/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_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:09:20,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:09:20,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:09:20,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:09:20,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:09:20,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:09:20,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:09:20,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:09:20,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:09:20,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:09:20,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:09:20,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:09:20,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:09:20,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:09:20,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:09:20,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:09:20,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:09:20,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:09:20,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:09:20,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:09:20,841 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:09:20,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:09:20,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:09:20,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:09:20,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:09:20,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:09:20,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:09:20,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:09:20,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:09:20,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:09:20,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:09:20,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:09:20,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:09:20,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:09:20,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:09:20,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:09:20,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:09:20,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:09:20,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:09:20,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:09:20,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:09:20,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:09:20,859 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-07 16:09:20,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:09:20,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:09:20,889 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 16:09:20,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 16:09:20,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 16:09:20,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 16:09:20,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 16:09:20,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 16:09:20,895 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 16:09:20,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:09:20,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:09:20,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:09:20,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:09:20,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:09:20,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:09:20,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:09:20,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:09:20,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:09:20,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:09:20,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:09:20,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:09:20,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:09:20,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:09:20,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 16:09:20,899 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 16:09:20,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 16:09:20,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 16:09:20,899 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-07 16:09:21,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:09:21,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:09:21,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:09:21,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:09:21,159 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:09:21,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-07 16:09:21,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bf1a081/6901688d18ae49e9a81cbfbdf597068f/FLAG479880f27 [2022-04-07 16:09:21,732 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:09:21,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-04-07 16:09:21,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bf1a081/6901688d18ae49e9a81cbfbdf597068f/FLAG479880f27 [2022-04-07 16:09:22,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bf1a081/6901688d18ae49e9a81cbfbdf597068f [2022-04-07 16:09:22,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:09:22,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 16:09:22,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:09:22,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:09:22,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:09:22,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a01016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22, skipping insertion in model container [2022-04-07 16:09:22,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:09:22,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:09:22,492 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_clnt.blast.01.i.cil-2.c[65520,65533] [2022-04-07 16:09:22,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:09:22,530 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:09:22,640 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_clnt.blast.01.i.cil-2.c[65520,65533] [2022-04-07 16:09:22,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:09:22,662 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:09:22,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22 WrapperNode [2022-04-07 16:09:22,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:09:22,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:09:22,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:09:22,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:09:22,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:09:22,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:09:22,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:09:22,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:09:22,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (1/1) ... [2022-04-07 16:09:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:09:22,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:09:22,825 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-07 16:09:22,844 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-07 16:09:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:09:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:09:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:09:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-07 16:09:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-07 16:09:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:09:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-07 16:09:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-07 16:09:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:09:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-07 16:09:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:09:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:09:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-07 16:09:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:09:23,022 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:09:23,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:09:24,609 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 16:09:25,173 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-07 16:09:25,174 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-07 16:09:25,199 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:09:25,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:09:25,210 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:09:25,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:09:25 BoogieIcfgContainer [2022-04-07 16:09:25,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:09:25,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:09:25,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:09:25,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:09:25,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:09:22" (1/3) ... [2022-04-07 16:09:25,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa4b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:09:25, skipping insertion in model container [2022-04-07 16:09:25,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:09:22" (2/3) ... [2022-04-07 16:09:25,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa4b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:09:25, skipping insertion in model container [2022-04-07 16:09:25,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:09:25" (3/3) ... [2022-04-07 16:09:25,227 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-04-07 16:09:25,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:09:25,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:09:25,281 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:09:25,287 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 16:09:25,287 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:09:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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-07 16:09:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 16:09:25,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:25,314 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:25,314 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-04-07 16:09:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:25,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055918172] [2022-04-07 16:09:25,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:25,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:26,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-07 16:09:26,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-07 16:09:26,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-07 16:09:26,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:26,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-07 16:09:26,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-07 16:09:26,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #591#return; {143#true} is VALID [2022-04-07 16:09:26,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-07 16:09:26,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {143#true} is VALID [2022-04-07 16:09:26,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-07 16:09:26,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:26,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:26,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:26,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:26,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:26,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {149#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-07 16:09:26,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {144#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {144#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {144#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {144#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {144#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {144#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {144#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {144#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {144#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {144#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {144#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {144#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-07 16:09:26,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {144#false} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-07 16:09:26,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-07 16:09:26,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-07 16:09:26,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-07 16:09:26,093 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-07 16:09:26,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:26,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055918172] [2022-04-07 16:09:26,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055918172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:26,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:26,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679540402] [2022-04-07 16:09:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-07 16:09:26,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:26,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:26,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:26,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:26,179 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 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 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:28,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:09:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:29,712 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-04-07 16:09:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-07 16:09:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-07 16:09:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-07 16:09:29,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-07 16:09:30,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:30,160 INFO L225 Difference]: With dead ends: 271 [2022-04-07 16:09:30,161 INFO L226 Difference]: Without dead ends: 124 [2022-04-07 16:09:30,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:30,167 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:30,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:09:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-07 16:09:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-07 16:09:30,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:30,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:30,204 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:30,205 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:30,211 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-07 16:09:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-07 16:09:30,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:30,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:30,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-07 16:09:30,214 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-07 16:09:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:30,219 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-07 16:09:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-07 16:09:30,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:30,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:30,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:30,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-04-07 16:09:30,228 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-04-07 16:09:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:30,228 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-04-07 16:09:30,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-04-07 16:09:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 16:09:30,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:30,230 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:30,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:09:30,231 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1834539841, now seen corresponding path program 1 times [2022-04-07 16:09:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:30,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097340086] [2022-04-07 16:09:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:30,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {867#true} is VALID [2022-04-07 16:09:30,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} assume true; {867#true} is VALID [2022-04-07 16:09:30,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {867#true} {867#true} #591#return; {867#true} is VALID [2022-04-07 16:09:30,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {867#true} call ULTIMATE.init(); {873#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:30,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {867#true} is VALID [2022-04-07 16:09:30,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#true} assume true; {867#true} is VALID [2022-04-07 16:09:30,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {867#true} {867#true} #591#return; {867#true} is VALID [2022-04-07 16:09:30,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {867#true} call #t~ret159 := main(); {867#true} is VALID [2022-04-07 16:09:30,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {867#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {867#true} is VALID [2022-04-07 16:09:30,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {867#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {867#true} is VALID [2022-04-07 16:09:30,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {872#(= ssl3_connect_~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)))); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !false; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !false; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {872#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-07 16:09:30,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {872#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {868#false} is VALID [2022-04-07 16:09:30,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {868#false} assume !false; {868#false} is VALID [2022-04-07 16:09:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:30,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097340086] [2022-04-07 16:09:30,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097340086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:30,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:30,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:09:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477098236] [2022-04-07 16:09:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:30,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-07 16:09:30,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:30,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:30,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:30,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:09:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:30,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:09:30,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:09:30,634 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:32,660 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-07 16:09:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:33,496 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-04-07 16:09:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:09:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-07 16:09:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-07 16:09:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-07 16:09:33,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-07 16:09:33,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:33,957 INFO L225 Difference]: With dead ends: 333 [2022-04-07 16:09:33,957 INFO L226 Difference]: Without dead ends: 226 [2022-04-07 16:09:33,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:09:33,966 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:33,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:09:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-07 16:09:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-04-07 16:09:33,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:33,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:33,986 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:33,987 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:34,002 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-07 16:09:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-07 16:09:34,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:34,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:34,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-07 16:09:34,011 INFO L87 Difference]: Start difference. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-07 16:09:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:34,021 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-07 16:09:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-07 16:09:34,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:34,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:34,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:34,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-04-07 16:09:34,032 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-04-07 16:09:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:34,033 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-04-07 16:09:34,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-07 16:09:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-07 16:09:34,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:34,037 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-07 16:09:34,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:09:34,037 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash 943673003, now seen corresponding path program 1 times [2022-04-07 16:09:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:34,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580015225] [2022-04-07 16:09:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:34,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {1989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1982#true} is VALID [2022-04-07 16:09:34,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1982#true} assume true; {1982#true} is VALID [2022-04-07 16:09:34,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1982#true} {1982#true} #591#return; {1982#true} is VALID [2022-04-07 16:09:34,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {1982#true} call ULTIMATE.init(); {1989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:34,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1989#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1982#true} is VALID [2022-04-07 16:09:34,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1982#true} assume true; {1982#true} is VALID [2022-04-07 16:09:34,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1982#true} {1982#true} #591#return; {1982#true} is VALID [2022-04-07 16:09:34,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1982#true} call #t~ret159 := main(); {1982#true} is VALID [2022-04-07 16:09:34,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1982#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {1982#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1982#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {1982#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1982#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {1982#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {1982#true} assume !false; {1982#true} is VALID [2022-04-07 16:09:34,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {1982#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {1982#true} assume 12292 == #t~mem43;havoc #t~mem43; {1982#true} is VALID [2022-04-07 16:09:34,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {1982#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {1982#true} is VALID [2022-04-07 16:09:34,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {1982#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1982#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1982#true} is VALID [2022-04-07 16:09:34,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {1982#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1982#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {1982#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {1982#true} is VALID [2022-04-07 16:09:34,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {1982#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {1982#true} is VALID [2022-04-07 16:09:34,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {1982#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {1982#true} is VALID [2022-04-07 16:09:34,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {1982#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {1982#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {1982#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1982#true} is VALID [2022-04-07 16:09:34,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {1982#true} ~skip~0 := 0; {1982#true} is VALID [2022-04-07 16:09:34,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {1982#true} assume !false; {1982#true} is VALID [2022-04-07 16:09:34,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {1982#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {1982#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {1982#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {1982#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {1982#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1982#true} is VALID [2022-04-07 16:09:34,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {1982#true} assume 4368 == #t~mem48;havoc #t~mem48; {1982#true} is VALID [2022-04-07 16:09:34,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {1982#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {1982#true} is VALID [2022-04-07 16:09:34,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {1982#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1982#true} is VALID [2022-04-07 16:09:34,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {1982#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:34,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {1987#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1988#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-07 16:09:34,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {1988#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1983#false} is VALID [2022-04-07 16:09:34,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {1983#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1983#false} is VALID [2022-04-07 16:09:34,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {1983#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 53: Hoare triple {1983#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {1983#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {1983#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {1983#false} assume 4432 == #t~mem56;havoc #t~mem56; {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {1983#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {1983#false} assume 5 == ~blastFlag~0; {1983#false} is VALID [2022-04-07 16:09:34,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2022-04-07 16:09:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580015225] [2022-04-07 16:09:34,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580015225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:34,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:34,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:34,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142367668] [2022-04-07 16:09:34,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:34,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-07 16:09:34,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:34,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:34,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:34,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:34,397 INFO L87 Difference]: Start difference. First operand 226 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:36,427 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-07 16:09:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:37,653 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-04-07 16:09:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-07 16:09:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-07 16:09:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-07 16:09:37,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-07 16:09:37,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:37,976 INFO L225 Difference]: With dead ends: 368 [2022-04-07 16:09:37,976 INFO L226 Difference]: Without dead ends: 261 [2022-04-07 16:09:37,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:37,977 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:37,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:09:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-07 16:09:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-04-07 16:09:37,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:37,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:37,991 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:37,992 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:38,000 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-07 16:09:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-07 16:09:38,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:38,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:38,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-07 16:09:38,003 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-07 16:09:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:38,011 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-07 16:09:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-07 16:09:38,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:38,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:38,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:38,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-04-07 16:09:38,020 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-04-07 16:09:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:38,020 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-04-07 16:09:38,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-04-07 16:09:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 16:09:38,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:38,022 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:38,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:09:38,022 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1523273022, now seen corresponding path program 2 times [2022-04-07 16:09:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:38,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222805442] [2022-04-07 16:09:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:38,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:38,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {3236#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {3229#true} is VALID [2022-04-07 16:09:38,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {3229#true} assume true; {3229#true} is VALID [2022-04-07 16:09:38,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3229#true} {3229#true} #591#return; {3229#true} is VALID [2022-04-07 16:09:38,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {3229#true} call ULTIMATE.init(); {3236#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:38,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {3236#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {3229#true} assume true; {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3229#true} {3229#true} #591#return; {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {3229#true} call #t~ret159 := main(); {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {3229#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {3229#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {3229#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {3229#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {3229#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {3229#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {3229#true} assume !false; {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {3229#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {3229#true} assume 12292 == #t~mem43;havoc #t~mem43; {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {3229#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {3229#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {3229#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3229#true} is VALID [2022-04-07 16:09:38,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {3229#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {3229#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {3229#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {3229#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {3229#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {3229#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {3229#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {3229#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {3229#true} ~skip~0 := 0; {3229#true} is VALID [2022-04-07 16:09:38,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {3229#true} assume !false; {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {3229#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {3229#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {3229#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {3229#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {3229#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {3229#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {3229#true} assume 4368 == #t~mem48;havoc #t~mem48; {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {3229#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {3229#true} is VALID [2022-04-07 16:09:38,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {3229#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3229#true} is VALID [2022-04-07 16:09:38,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {3229#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:38,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:38,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:38,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:38,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:38,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:38,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {3234#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3235#(= |ssl3_connect_#t~mem43| 4384)} is VALID [2022-04-07 16:09:38,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {3235#(= |ssl3_connect_#t~mem43| 4384)} assume 12292 == #t~mem43;havoc #t~mem43; {3230#false} is VALID [2022-04-07 16:09:38,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {3230#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {3230#false} is VALID [2022-04-07 16:09:38,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {3230#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {3230#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {3230#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {3230#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {3230#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {3230#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {3230#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {3230#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {3230#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {3230#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {3230#false} is VALID [2022-04-07 16:09:38,271 INFO L290 TraceCheckUtils]: 55: Hoare triple {3230#false} ~skip~0 := 0; {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {3230#false} assume !false; {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {3230#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {3230#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 59: Hoare triple {3230#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 60: Hoare triple {3230#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {3230#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 62: Hoare triple {3230#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {3230#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {3230#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 65: Hoare triple {3230#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 66: Hoare triple {3230#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 67: Hoare triple {3230#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 68: Hoare triple {3230#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 69: Hoare triple {3230#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 70: Hoare triple {3230#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {3230#false} assume 4432 == #t~mem56;havoc #t~mem56; {3230#false} is VALID [2022-04-07 16:09:38,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {3230#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {3230#false} is VALID [2022-04-07 16:09:38,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {3230#false} assume 5 == ~blastFlag~0; {3230#false} is VALID [2022-04-07 16:09:38,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {3230#false} assume !false; {3230#false} is VALID [2022-04-07 16:09:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:38,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222805442] [2022-04-07 16:09:38,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222805442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:38,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:38,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312666542] [2022-04-07 16:09:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:38,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-07 16:09:38,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:38,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:38,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:38,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:38,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:38,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:38,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:38,345 INFO L87 Difference]: Start difference. First operand 244 states and 360 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:40,373 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-07 16:09:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:41,378 INFO L93 Difference]: Finished difference Result 385 states and 571 transitions. [2022-04-07 16:09:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-07 16:09:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-07 16:09:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-07 16:09:41,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-07 16:09:41,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:41,706 INFO L225 Difference]: With dead ends: 385 [2022-04-07 16:09:41,706 INFO L226 Difference]: Without dead ends: 260 [2022-04-07 16:09:41,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:41,708 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:41,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 490 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:09:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-07 16:09:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 244. [2022-04-07 16:09:41,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:41,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,718 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,718 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:41,725 INFO L93 Difference]: Finished difference Result 260 states and 380 transitions. [2022-04-07 16:09:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2022-04-07 16:09:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:41,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 260 states. [2022-04-07 16:09:41,727 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 260 states. [2022-04-07 16:09:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:41,733 INFO L93 Difference]: Finished difference Result 260 states and 380 transitions. [2022-04-07 16:09:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2022-04-07 16:09:41,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:41,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:41,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:41,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 359 transitions. [2022-04-07 16:09:41,740 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 359 transitions. Word has length 75 [2022-04-07 16:09:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:41,740 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 359 transitions. [2022-04-07 16:09:41,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 359 transitions. [2022-04-07 16:09:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 16:09:41,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:41,742 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2022-04-07 16:09:41,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 16:09:41,742 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1541928480, now seen corresponding path program 1 times [2022-04-07 16:09:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867439390] [2022-04-07 16:09:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:42,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {4498#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4491#true} is VALID [2022-04-07 16:09:42,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {4491#true} assume true; {4491#true} is VALID [2022-04-07 16:09:42,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4491#true} {4491#true} #591#return; {4491#true} is VALID [2022-04-07 16:09:42,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {4491#true} call ULTIMATE.init(); {4498#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:42,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4491#true} is VALID [2022-04-07 16:09:42,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {4491#true} assume true; {4491#true} is VALID [2022-04-07 16:09:42,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4491#true} {4491#true} #591#return; {4491#true} is VALID [2022-04-07 16:09:42,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {4491#true} call #t~ret159 := main(); {4491#true} is VALID [2022-04-07 16:09:42,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {4491#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4491#true} is VALID [2022-04-07 16:09:42,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {4491#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4491#true} is VALID [2022-04-07 16:09:42,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {4491#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {4491#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {4491#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {4491#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {4491#true} assume !false; {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {4491#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {4491#true} assume 12292 == #t~mem43;havoc #t~mem43; {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {4491#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {4491#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {4491#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4491#true} is VALID [2022-04-07 16:09:42,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {4491#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {4491#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {4491#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4491#true} is VALID [2022-04-07 16:09:42,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {4491#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4491#true} is VALID [2022-04-07 16:09:42,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {4491#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4491#true} is VALID [2022-04-07 16:09:42,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {4491#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {4491#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {4491#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4491#true} is VALID [2022-04-07 16:09:42,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {4491#true} ~skip~0 := 0; {4491#true} is VALID [2022-04-07 16:09:42,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {4491#true} assume !false; {4491#true} is VALID [2022-04-07 16:09:42,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {4491#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {4491#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {4491#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {4491#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {4491#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {4491#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4491#true} is VALID [2022-04-07 16:09:42,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {4491#true} assume 4368 == #t~mem48;havoc #t~mem48; {4491#true} is VALID [2022-04-07 16:09:42,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {4491#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {4491#true} is VALID [2022-04-07 16:09:42,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {4491#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4491#true} is VALID [2022-04-07 16:09:42,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {4491#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:42,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {4496#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4497#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-07 16:09:42,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {4497#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {4492#false} is VALID [2022-04-07 16:09:42,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {4492#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {4492#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4492#false} is VALID [2022-04-07 16:09:42,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {4492#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {4492#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {4492#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {4492#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {4492#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {4492#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {4492#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {4492#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4492#false} is VALID [2022-04-07 16:09:42,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {4492#false} ~skip~0 := 0; {4492#false} is VALID [2022-04-07 16:09:42,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {4492#false} assume !false; {4492#false} is VALID [2022-04-07 16:09:42,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {4492#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {4492#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {4492#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 60: Hoare triple {4492#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 61: Hoare triple {4492#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {4492#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {4492#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {4492#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {4492#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {4492#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,025 INFO L290 TraceCheckUtils]: 67: Hoare triple {4492#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {4492#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {4492#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 70: Hoare triple {4492#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 71: Hoare triple {4492#false} assume 4432 == #t~mem56;havoc #t~mem56; {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {4492#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {4492#false} assume 5 == ~blastFlag~0; {4492#false} is VALID [2022-04-07 16:09:42,026 INFO L290 TraceCheckUtils]: 74: Hoare triple {4492#false} assume !false; {4492#false} is VALID [2022-04-07 16:09:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:42,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867439390] [2022-04-07 16:09:42,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867439390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:42,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:42,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608930120] [2022-04-07 16:09:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:42,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-07 16:09:42,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:42,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:42,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:42,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:42,096 INFO L87 Difference]: Start difference. First operand 244 states and 359 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:44,125 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-07 16:09:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:45,378 INFO L93 Difference]: Finished difference Result 657 states and 976 transitions. [2022-04-07 16:09:45,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:45,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-07 16:09:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-07 16:09:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-07 16:09:45,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-07 16:09:45,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:45,753 INFO L225 Difference]: With dead ends: 657 [2022-04-07 16:09:45,753 INFO L226 Difference]: Without dead ends: 429 [2022-04-07 16:09:45,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:45,755 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:45,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:09:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-07 16:09:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 268. [2022-04-07 16:09:45,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:45,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,769 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,770 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:45,782 INFO L93 Difference]: Finished difference Result 429 states and 634 transitions. [2022-04-07 16:09:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 634 transitions. [2022-04-07 16:09:45,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:45,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:45,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-07 16:09:45,784 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-07 16:09:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:45,796 INFO L93 Difference]: Finished difference Result 429 states and 634 transitions. [2022-04-07 16:09:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 634 transitions. [2022-04-07 16:09:45,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:45,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:45,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:45,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 394 transitions. [2022-04-07 16:09:45,805 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 394 transitions. Word has length 75 [2022-04-07 16:09:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:45,805 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 394 transitions. [2022-04-07 16:09:45,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 394 transitions. [2022-04-07 16:09:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 16:09:45,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:45,806 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-04-07 16:09:45,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 16:09:45,806 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1572013375, now seen corresponding path program 1 times [2022-04-07 16:09:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:45,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659475822] [2022-04-07 16:09:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:46,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {6442#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {6435#true} is VALID [2022-04-07 16:09:46,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {6435#true} assume true; {6435#true} is VALID [2022-04-07 16:09:46,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6435#true} {6435#true} #591#return; {6435#true} is VALID [2022-04-07 16:09:46,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {6435#true} call ULTIMATE.init(); {6442#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:46,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {6442#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {6435#true} is VALID [2022-04-07 16:09:46,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {6435#true} assume true; {6435#true} is VALID [2022-04-07 16:09:46,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6435#true} {6435#true} #591#return; {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {6435#true} call #t~ret159 := main(); {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {6435#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {6435#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {6435#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {6435#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {6435#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {6435#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {6435#true} assume !false; {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {6435#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {6435#true} assume 12292 == #t~mem43;havoc #t~mem43; {6435#true} is VALID [2022-04-07 16:09:46,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {6435#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {6435#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {6435#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {6435#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {6435#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {6435#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {6435#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {6435#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {6435#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {6435#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {6435#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {6435#true} ~skip~0 := 0; {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {6435#true} assume !false; {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {6435#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {6435#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {6435#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {6435#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {6435#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {6435#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6435#true} is VALID [2022-04-07 16:09:46,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {6435#true} assume 4368 == #t~mem48;havoc #t~mem48; {6435#true} is VALID [2022-04-07 16:09:46,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {6435#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {6435#true} is VALID [2022-04-07 16:09:46,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {6435#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6435#true} is VALID [2022-04-07 16:09:46,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {6435#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:46,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {6440#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {6441#(= |ssl3_connect_#t~mem45| 4384)} is VALID [2022-04-07 16:09:46,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {6441#(= |ssl3_connect_#t~mem45| 4384)} assume 4096 == #t~mem45;havoc #t~mem45; {6436#false} is VALID [2022-04-07 16:09:46,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {6436#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {6436#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6436#false} is VALID [2022-04-07 16:09:46,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {6436#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {6436#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {6436#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {6436#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {6436#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {6436#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {6436#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {6436#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {6436#false} ~skip~0 := 0; {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {6436#false} assume !false; {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {6436#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {6436#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {6436#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {6436#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,060 INFO L290 TraceCheckUtils]: 62: Hoare triple {6436#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {6436#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {6436#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {6436#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {6436#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {6436#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {6436#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,061 INFO L290 TraceCheckUtils]: 69: Hoare triple {6436#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {6436#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,064 INFO L290 TraceCheckUtils]: 71: Hoare triple {6436#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6436#false} is VALID [2022-04-07 16:09:46,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {6436#false} assume 4432 == #t~mem56;havoc #t~mem56; {6436#false} is VALID [2022-04-07 16:09:46,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {6436#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {6436#false} is VALID [2022-04-07 16:09:46,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {6436#false} assume 5 == ~blastFlag~0; {6436#false} is VALID [2022-04-07 16:09:46,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {6436#false} assume !false; {6436#false} is VALID [2022-04-07 16:09:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:46,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659475822] [2022-04-07 16:09:46,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659475822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:46,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:46,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336525514] [2022-04-07 16:09:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-07 16:09:46,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:46,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:46,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:46,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:46,133 INFO L87 Difference]: Start difference. First operand 268 states and 394 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:48,161 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-07 16:09:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:49,322 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2022-04-07 16:09:49,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:49,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-07 16:09:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:09:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-07 16:09:49,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-07 16:09:49,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:49,670 INFO L225 Difference]: With dead ends: 421 [2022-04-07 16:09:49,670 INFO L226 Difference]: Without dead ends: 284 [2022-04-07 16:09:49,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:49,674 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:49,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:09:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-07 16:09:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-07 16:09:49,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:49,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 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-07 16:09:49,688 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 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-07 16:09:49,688 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 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-07 16:09:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:49,694 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2022-04-07 16:09:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 414 transitions. [2022-04-07 16:09:49,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:49,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:49,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 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 284 states. [2022-04-07 16:09:49,697 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 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 284 states. [2022-04-07 16:09:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:49,703 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2022-04-07 16:09:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 414 transitions. [2022-04-07 16:09:49,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:49,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:49,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:49,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 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-07 16:09:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 393 transitions. [2022-04-07 16:09:49,710 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 393 transitions. Word has length 76 [2022-04-07 16:09:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:49,711 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 393 transitions. [2022-04-07 16:09:49,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 393 transitions. [2022-04-07 16:09:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-07 16:09:49,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:49,712 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:49,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 16:09:49,713 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1073962757, now seen corresponding path program 1 times [2022-04-07 16:09:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:49,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952596653] [2022-04-07 16:09:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:49,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {7817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7810#true} is VALID [2022-04-07 16:09:49,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {7810#true} assume true; {7810#true} is VALID [2022-04-07 16:09:49,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7810#true} {7810#true} #591#return; {7810#true} is VALID [2022-04-07 16:09:49,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {7810#true} call ULTIMATE.init(); {7817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:49,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {7817#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7810#true} is VALID [2022-04-07 16:09:49,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {7810#true} assume true; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7810#true} {7810#true} #591#return; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {7810#true} call #t~ret159 := main(); {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {7810#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {7810#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {7810#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {7810#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {7810#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {7810#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {7810#true} assume !false; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {7810#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {7810#true} assume 12292 == #t~mem43;havoc #t~mem43; {7810#true} is VALID [2022-04-07 16:09:49,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {7810#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {7810#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {7810#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {7810#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {7810#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {7810#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {7810#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {7810#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {7810#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {7810#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {7810#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {7810#true} ~skip~0 := 0; {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {7810#true} assume !false; {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {7810#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {7810#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {7810#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {7810#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {7810#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {7810#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7810#true} is VALID [2022-04-07 16:09:49,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {7810#true} assume 4368 == #t~mem48;havoc #t~mem48; {7810#true} is VALID [2022-04-07 16:09:49,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {7810#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7810#true} is VALID [2022-04-07 16:09:49,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {7810#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7810#true} is VALID [2022-04-07 16:09:49,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {7810#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-07 16:09:49,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {7815#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7816#(= |ssl3_connect_#t~mem46| 4384)} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {7816#(= |ssl3_connect_#t~mem46| 4384)} assume 20480 == #t~mem46;havoc #t~mem46; {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {7811#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {7811#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {7811#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {7811#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {7811#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {7811#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7811#false} is VALID [2022-04-07 16:09:49,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {7811#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {7811#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {7811#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {7811#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {7811#false} ~skip~0 := 0; {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {7811#false} assume !false; {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {7811#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 60: Hoare triple {7811#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {7811#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {7811#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {7811#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {7811#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {7811#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {7811#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {7811#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {7811#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {7811#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {7811#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {7811#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {7811#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {7811#false} assume 4432 == #t~mem56;havoc #t~mem56; {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {7811#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {7811#false} assume 5 == ~blastFlag~0; {7811#false} is VALID [2022-04-07 16:09:49,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {7811#false} assume !false; {7811#false} is VALID [2022-04-07 16:09:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:49,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952596653] [2022-04-07 16:09:49,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952596653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:49,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:49,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:49,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110932836] [2022-04-07 16:09:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-07 16:09:49,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:49,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:50,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:50,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:50,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:50,009 INFO L87 Difference]: Start difference. First operand 268 states and 393 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:52,038 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-07 16:09:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:53,300 INFO L93 Difference]: Finished difference Result 421 states and 619 transitions. [2022-04-07 16:09:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-07 16:09:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-07 16:09:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-07 16:09:53,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 385 transitions. [2022-04-07 16:09:53,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:53,625 INFO L225 Difference]: With dead ends: 421 [2022-04-07 16:09:53,625 INFO L226 Difference]: Without dead ends: 284 [2022-04-07 16:09:53,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:53,626 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:53,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:09:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-07 16:09:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-07 16:09:53,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:53,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,635 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,636 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:53,642 INFO L93 Difference]: Finished difference Result 284 states and 413 transitions. [2022-04-07 16:09:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 413 transitions. [2022-04-07 16:09:53,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:53,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:53,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-07 16:09:53,644 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-07 16:09:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:53,650 INFO L93 Difference]: Finished difference Result 284 states and 413 transitions. [2022-04-07 16:09:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 413 transitions. [2022-04-07 16:09:53,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:53,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:53,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:53,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-04-07 16:09:53,658 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 77 [2022-04-07 16:09:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:53,658 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-04-07 16:09:53,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-04-07 16:09:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 16:09:53,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:53,660 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-04-07 16:09:53,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 16:09:53,660 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 273295172, now seen corresponding path program 1 times [2022-04-07 16:09:53,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:53,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505123268] [2022-04-07 16:09:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:53,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {9192#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9185#true} is VALID [2022-04-07 16:09:53,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {9185#true} assume true; {9185#true} is VALID [2022-04-07 16:09:53,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9185#true} {9185#true} #591#return; {9185#true} is VALID [2022-04-07 16:09:53,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {9185#true} call ULTIMATE.init(); {9192#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:53,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {9192#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {9185#true} assume true; {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9185#true} {9185#true} #591#return; {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {9185#true} call #t~ret159 := main(); {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {9185#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {9185#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {9185#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {9185#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {9185#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {9185#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {9185#true} assume !false; {9185#true} is VALID [2022-04-07 16:09:53,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {9185#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {9185#true} assume 12292 == #t~mem43;havoc #t~mem43; {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {9185#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {9185#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {9185#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {9185#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {9185#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {9185#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {9185#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {9185#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {9185#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {9185#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {9185#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {9185#true} ~skip~0 := 0; {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {9185#true} assume !false; {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {9185#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {9185#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {9185#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {9185#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {9185#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {9185#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {9185#true} assume 4368 == #t~mem48;havoc #t~mem48; {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {9185#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {9185#true} is VALID [2022-04-07 16:09:53,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {9185#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9185#true} is VALID [2022-04-07 16:09:53,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {9185#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:09:53,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {9190#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9191#(not (= |ssl3_connect_#t~mem47| 4099))} is VALID [2022-04-07 16:09:53,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {9191#(not (= |ssl3_connect_#t~mem47| 4099))} assume 4099 == #t~mem47;havoc #t~mem47; {9186#false} is VALID [2022-04-07 16:09:53,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {9186#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {9186#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9186#false} is VALID [2022-04-07 16:09:53,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {9186#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {9186#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {9186#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {9186#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {9186#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {9186#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {9186#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {9186#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {9186#false} ~skip~0 := 0; {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 59: Hoare triple {9186#false} assume !false; {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 60: Hoare triple {9186#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,885 INFO L290 TraceCheckUtils]: 61: Hoare triple {9186#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {9186#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {9186#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {9186#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {9186#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 66: Hoare triple {9186#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 67: Hoare triple {9186#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 68: Hoare triple {9186#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {9186#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {9186#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {9186#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {9186#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,887 INFO L290 TraceCheckUtils]: 73: Hoare triple {9186#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9186#false} is VALID [2022-04-07 16:09:53,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {9186#false} assume 4432 == #t~mem56;havoc #t~mem56; {9186#false} is VALID [2022-04-07 16:09:53,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {9186#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {9186#false} is VALID [2022-04-07 16:09:53,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {9186#false} assume 5 == ~blastFlag~0; {9186#false} is VALID [2022-04-07 16:09:53,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {9186#false} assume !false; {9186#false} is VALID [2022-04-07 16:09:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:09:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:53,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505123268] [2022-04-07 16:09:53,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505123268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:53,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:53,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:09:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095121339] [2022-04-07 16:09:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 16:09:53,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:53,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:53,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:53,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:09:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:09:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:09:53,981 INFO L87 Difference]: Start difference. First operand 268 states and 392 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:56,006 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-07 16:09:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:57,226 INFO L93 Difference]: Finished difference Result 681 states and 1004 transitions. [2022-04-07 16:09:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:09:57,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 16:09:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:09:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-07 16:09:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-07 16:09:57,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-07 16:09:57,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:09:57,661 INFO L225 Difference]: With dead ends: 681 [2022-04-07 16:09:57,661 INFO L226 Difference]: Without dead ends: 429 [2022-04-07 16:09:57,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:09:57,662 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 16:09:57,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 16:09:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-07 16:09:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 274. [2022-04-07 16:09:57,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:09:57,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,691 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,693 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:57,704 INFO L93 Difference]: Finished difference Result 429 states and 629 transitions. [2022-04-07 16:09:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 629 transitions. [2022-04-07 16:09:57,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:57,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:57,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-07 16:09:57,707 INFO L87 Difference]: Start difference. First operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 429 states. [2022-04-07 16:09:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:09:57,718 INFO L93 Difference]: Finished difference Result 429 states and 629 transitions. [2022-04-07 16:09:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 629 transitions. [2022-04-07 16:09:57,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:09:57,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:09:57,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:09:57,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:09:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2022-04-07 16:09:57,726 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 78 [2022-04-07 16:09:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:09:57,726 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-04-07 16:09:57,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:09:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2022-04-07 16:09:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 16:09:57,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:09:57,729 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:09:57,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 16:09:57,730 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:09:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:09:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash 369392995, now seen corresponding path program 1 times [2022-04-07 16:09:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:09:57,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083062903] [2022-04-07 16:09:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:09:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:09:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:09:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:09:57,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {11167#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11161#true} is VALID [2022-04-07 16:09:57,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {11161#true} assume true; {11161#true} is VALID [2022-04-07 16:09:57,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11161#true} {11161#true} #591#return; {11161#true} is VALID [2022-04-07 16:09:57,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {11161#true} call ULTIMATE.init(); {11167#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:09:57,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {11167#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11161#true} is VALID [2022-04-07 16:09:57,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {11161#true} assume true; {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11161#true} {11161#true} #591#return; {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {11161#true} call #t~ret159 := main(); {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {11161#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {11161#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {11161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {11161#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {11161#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {11161#true} is VALID [2022-04-07 16:09:57,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {11161#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {11161#true} assume !false; {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {11161#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {11161#true} assume 12292 == #t~mem43;havoc #t~mem43; {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {11161#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {11161#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {11161#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {11161#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {11161#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {11161#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {11161#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11161#true} is VALID [2022-04-07 16:09:57,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {11161#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {11161#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {11161#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {11161#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {11161#true} ~skip~0 := 0; {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {11161#true} assume !false; {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {11161#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {11161#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {11161#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {11161#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {11161#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {11161#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {11161#true} assume 4368 == #t~mem48;havoc #t~mem48; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {11161#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {11161#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {11161#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {11161#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {11161#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {11161#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {11161#true} ~skip~0 := 0; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {11161#true} assume !false; {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {11161#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {11161#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {11161#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {11161#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {11161#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {11161#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {11161#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {11161#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11161#true} is VALID [2022-04-07 16:09:57,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {11161#true} assume 4384 == #t~mem50;havoc #t~mem50; {11161#true} is VALID [2022-04-07 16:09:57,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {11161#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {11161#true} is VALID [2022-04-07 16:09:57,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {11161#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,919 INFO L290 TraceCheckUtils]: 56: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,919 INFO L290 TraceCheckUtils]: 57: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,920 INFO L290 TraceCheckUtils]: 59: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,921 INFO L290 TraceCheckUtils]: 64: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,922 INFO L290 TraceCheckUtils]: 67: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,923 INFO L290 TraceCheckUtils]: 68: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,923 INFO L290 TraceCheckUtils]: 70: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,924 INFO L290 TraceCheckUtils]: 73: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {11166#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:09:57,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {11166#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {11162#false} is VALID [2022-04-07 16:09:57,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {11162#false} assume !false; {11162#false} is VALID [2022-04-07 16:09:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 16:09:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:09:57,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083062903] [2022-04-07 16:09:57,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083062903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:09:57,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:09:57,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:09:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263686125] [2022-04-07 16:09:57,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:09:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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 78 [2022-04-07 16:09:57,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:09:57,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-07 16:09:57,991 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-07 16:09:57,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:09:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:09:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:09:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:09:57,992 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-07 16:10:00,014 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-07 16:10:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,117 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-04-07 16:10:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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 78 [2022-04-07 16:10:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-07 16:10:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-07 16:10:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-07 16:10:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-07 16:10:01,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-07 16:10:01,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:01,547 INFO L225 Difference]: With dead ends: 551 [2022-04-07 16:10:01,547 INFO L226 Difference]: Without dead ends: 411 [2022-04-07 16:10:01,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:01,548 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:01,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-07 16:10:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2022-04-07 16:10:01,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:01,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,558 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,559 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,569 INFO L93 Difference]: Finished difference Result 411 states and 601 transitions. [2022-04-07 16:10:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 601 transitions. [2022-04-07 16:10:01,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:01,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:01,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-07 16:10:01,572 INFO L87 Difference]: Start difference. First operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-07 16:10:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:01,582 INFO L93 Difference]: Finished difference Result 411 states and 601 transitions. [2022-04-07 16:10:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 601 transitions. [2022-04-07 16:10:01,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:01,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:01,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:01,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 601 transitions. [2022-04-07 16:10:01,594 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 601 transitions. Word has length 78 [2022-04-07 16:10:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:01,595 INFO L478 AbstractCegarLoop]: Abstraction has 411 states and 601 transitions. [2022-04-07 16:10:01,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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-07 16:10:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 601 transitions. [2022-04-07 16:10:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 16:10:01,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:01,596 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:01,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 16:10:01,596 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 431432609, now seen corresponding path program 1 times [2022-04-07 16:10:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:01,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423312297] [2022-04-07 16:10:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:01,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {13099#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13093#true} is VALID [2022-04-07 16:10:01,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {13093#true} assume true; {13093#true} is VALID [2022-04-07 16:10:01,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13093#true} {13093#true} #591#return; {13093#true} is VALID [2022-04-07 16:10:01,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {13093#true} call ULTIMATE.init(); {13099#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:01,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {13099#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {13093#true} assume true; {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13093#true} {13093#true} #591#return; {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {13093#true} call #t~ret159 := main(); {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {13093#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {13093#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {13093#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {13093#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {13093#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {13093#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {13093#true} assume !false; {13093#true} is VALID [2022-04-07 16:10:01,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {13093#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {13093#true} assume 12292 == #t~mem43;havoc #t~mem43; {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {13093#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {13093#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {13093#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {13093#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {13093#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {13093#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {13093#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {13093#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {13093#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {13093#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {13093#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {13093#true} ~skip~0 := 0; {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {13093#true} assume !false; {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {13093#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {13093#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {13093#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {13093#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {13093#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {13093#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {13093#true} assume 4368 == #t~mem48;havoc #t~mem48; {13093#true} is VALID [2022-04-07 16:10:01,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {13093#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {13093#true} is VALID [2022-04-07 16:10:01,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {13093#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !false; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {13098#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-07 16:10:01,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {13098#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {13094#false} is VALID [2022-04-07 16:10:01,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {13094#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {13094#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {13094#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {13094#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {13094#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {13094#false} ~skip~0 := 0; {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {13094#false} assume !false; {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {13094#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {13094#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {13094#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {13094#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {13094#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {13094#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {13094#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {13094#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {13094#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {13094#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {13094#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {13094#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {13094#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {13094#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {13094#false} assume 4432 == #t~mem56;havoc #t~mem56; {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {13094#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {13094#false} assume 5 == ~blastFlag~0; {13094#false} is VALID [2022-04-07 16:10:01,778 INFO L290 TraceCheckUtils]: 77: Hoare triple {13094#false} assume !false; {13094#false} is VALID [2022-04-07 16:10:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 16:10:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:01,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423312297] [2022-04-07 16:10:01,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423312297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:01,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:01,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:01,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556468698] [2022-04-07 16:10:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 16:10:01,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:01,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:01,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:01,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:01,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:01,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:01,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:01,849 INFO L87 Difference]: Start difference. First operand 411 states and 601 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:03,871 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-07 16:10:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:04,585 INFO L93 Difference]: Finished difference Result 712 states and 1043 transitions. [2022-04-07 16:10:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-07 16:10:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-07 16:10:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-07 16:10:04,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-07 16:10:04,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:04,906 INFO L225 Difference]: With dead ends: 712 [2022-04-07 16:10:04,906 INFO L226 Difference]: Without dead ends: 435 [2022-04-07 16:10:04,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:04,907 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:04,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:10:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-04-07 16:10:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-04-07 16:10:04,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:04,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,919 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,921 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:04,933 INFO L93 Difference]: Finished difference Result 435 states and 633 transitions. [2022-04-07 16:10:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2022-04-07 16:10:04,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:04,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:04,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 435 states. [2022-04-07 16:10:04,937 INFO L87 Difference]: Start difference. First operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 435 states. [2022-04-07 16:10:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:04,948 INFO L93 Difference]: Finished difference Result 435 states and 633 transitions. [2022-04-07 16:10:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2022-04-07 16:10:04,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:04,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:04,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:04,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 633 transitions. [2022-04-07 16:10:04,962 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 633 transitions. Word has length 78 [2022-04-07 16:10:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:04,962 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 633 transitions. [2022-04-07 16:10:04,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2022-04-07 16:10:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 16:10:04,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:04,963 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:04,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 16:10:04,964 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:04,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 1 times [2022-04-07 16:10:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:04,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960458281] [2022-04-07 16:10:04,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:04,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:05,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {15288#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15282#true} is VALID [2022-04-07 16:10:05,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {15282#true} assume true; {15282#true} is VALID [2022-04-07 16:10:05,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15282#true} {15282#true} #591#return; {15282#true} is VALID [2022-04-07 16:10:05,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {15282#true} call ULTIMATE.init(); {15288#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:05,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {15288#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15282#true} is VALID [2022-04-07 16:10:05,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {15282#true} assume true; {15282#true} is VALID [2022-04-07 16:10:05,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15282#true} {15282#true} #591#return; {15282#true} is VALID [2022-04-07 16:10:05,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {15282#true} call #t~ret159 := main(); {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {15282#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {15282#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {15282#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {15282#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {15282#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {15282#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {15282#true} assume !false; {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {15282#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {15282#true} assume 12292 == #t~mem43;havoc #t~mem43; {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {15282#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {15282#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {15282#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {15282#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {15282#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {15282#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {15282#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {15282#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {15282#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {15282#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {15282#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {15282#true} ~skip~0 := 0; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {15282#true} assume !false; {15282#true} is VALID [2022-04-07 16:10:05,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {15282#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {15282#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {15282#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {15282#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {15282#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {15282#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {15282#true} assume 4368 == #t~mem48;havoc #t~mem48; {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {15282#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {15282#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {15282#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {15282#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {15282#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {15282#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {15282#true} ~skip~0 := 0; {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {15282#true} assume !false; {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {15282#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {15282#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {15282#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {15282#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {15282#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {15282#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {15282#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {15282#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {15282#true} assume 4384 == #t~mem50;havoc #t~mem50; {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {15282#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {15282#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {15282#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {15282#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {15282#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {15282#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {15282#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {15282#true} ~skip~0 := 0; {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 59: Hoare triple {15282#true} assume !false; {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {15282#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {15282#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {15282#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {15282#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {15282#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 65: Hoare triple {15282#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 66: Hoare triple {15282#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {15282#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {15282#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {15282#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {15282#true} assume 4400 == #t~mem52;havoc #t~mem52; {15282#true} is VALID [2022-04-07 16:10:05,204 INFO L290 TraceCheckUtils]: 71: Hoare triple {15282#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {15282#true} is VALID [2022-04-07 16:10:05,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {15282#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {15282#true} is VALID [2022-04-07 16:10:05,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {15282#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,205 INFO L290 TraceCheckUtils]: 74: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,207 INFO L290 TraceCheckUtils]: 78: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,208 INFO L290 TraceCheckUtils]: 81: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,208 INFO L290 TraceCheckUtils]: 82: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,208 INFO L290 TraceCheckUtils]: 83: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,209 INFO L290 TraceCheckUtils]: 84: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,210 INFO L290 TraceCheckUtils]: 88: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,210 INFO L290 TraceCheckUtils]: 89: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,211 INFO L290 TraceCheckUtils]: 91: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,211 INFO L290 TraceCheckUtils]: 92: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,211 INFO L290 TraceCheckUtils]: 93: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,212 INFO L290 TraceCheckUtils]: 94: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,212 INFO L290 TraceCheckUtils]: 95: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {15287#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-07 16:10:05,212 INFO L290 TraceCheckUtils]: 96: Hoare triple {15287#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15283#false} is VALID [2022-04-07 16:10:05,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {15283#false} assume !false; {15283#false} is VALID [2022-04-07 16:10:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-07 16:10:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:05,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960458281] [2022-04-07 16:10:05,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960458281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:05,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:05,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:05,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797986572] [2022-04-07 16:10:05,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-07 16:10:05,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:05,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:05,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:05,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:05,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:05,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:05,283 INFO L87 Difference]: Start difference. First operand 435 states and 633 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:07,306 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-07 16:10:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,430 INFO L93 Difference]: Finished difference Result 872 states and 1278 transitions. [2022-04-07 16:10:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-07 16:10:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-07 16:10:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-07 16:10:08,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-07 16:10:08,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:08,809 INFO L225 Difference]: With dead ends: 872 [2022-04-07 16:10:08,809 INFO L226 Difference]: Without dead ends: 571 [2022-04-07 16:10:08,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:08,811 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:08,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-07 16:10:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2022-04-07 16:10:08,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:08,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,824 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,825 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,841 INFO L93 Difference]: Finished difference Result 571 states and 832 transitions. [2022-04-07 16:10:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 832 transitions. [2022-04-07 16:10:08,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:08,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:08,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-07 16:10:08,844 INFO L87 Difference]: Start difference. First operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 571 states. [2022-04-07 16:10:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:08,860 INFO L93 Difference]: Finished difference Result 571 states and 832 transitions. [2022-04-07 16:10:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 832 transitions. [2022-04-07 16:10:08,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:08,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:08,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:08,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 832 transitions. [2022-04-07 16:10:08,880 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 832 transitions. Word has length 98 [2022-04-07 16:10:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:08,880 INFO L478 AbstractCegarLoop]: Abstraction has 571 states and 832 transitions. [2022-04-07 16:10:08,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 832 transitions. [2022-04-07 16:10:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-07 16:10:08,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:08,882 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:08,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 16:10:08,882 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-04-07 16:10:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505094606] [2022-04-07 16:10:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:09,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {18084#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18078#true} is VALID [2022-04-07 16:10:09,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {18078#true} assume true; {18078#true} is VALID [2022-04-07 16:10:09,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18078#true} {18078#true} #591#return; {18078#true} is VALID [2022-04-07 16:10:09,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {18078#true} call ULTIMATE.init(); {18084#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:09,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {18084#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18078#true} is VALID [2022-04-07 16:10:09,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {18078#true} assume true; {18078#true} is VALID [2022-04-07 16:10:09,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18078#true} {18078#true} #591#return; {18078#true} is VALID [2022-04-07 16:10:09,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {18078#true} call #t~ret159 := main(); {18078#true} is VALID [2022-04-07 16:10:09,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {18078#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {18078#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {18078#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {18078#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {18078#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {18078#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {18078#true} assume !false; {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {18078#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {18078#true} assume 12292 == #t~mem43;havoc #t~mem43; {18078#true} is VALID [2022-04-07 16:10:09,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {18078#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {18078#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {18078#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {18078#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {18078#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {18078#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {18078#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {18078#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {18078#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {18078#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {18078#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {18078#true} ~skip~0 := 0; {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {18078#true} assume !false; {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {18078#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {18078#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {18078#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {18078#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {18078#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {18078#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {18078#true} assume 4368 == #t~mem48;havoc #t~mem48; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {18078#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {18078#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {18078#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {18078#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {18078#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {18078#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {18078#true} ~skip~0 := 0; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {18078#true} assume !false; {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {18078#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {18078#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {18078#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {18078#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {18078#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {18078#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {18078#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {18078#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {18078#true} assume 4384 == #t~mem50;havoc #t~mem50; {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {18078#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {18078#true} is VALID [2022-04-07 16:10:09,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {18078#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {18078#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {18078#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {18078#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {18078#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {18078#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {18078#true} ~skip~0 := 0; {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {18078#true} assume !false; {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {18078#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {18078#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {18078#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {18078#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {18078#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {18078#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {18078#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {18078#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {18078#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {18078#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {18078#true} assume 4400 == #t~mem52;havoc #t~mem52; {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 71: Hoare triple {18078#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {18078#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {18078#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {18078#true} assume !(~ret~0 <= 0); {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {18078#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {18078#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {18078#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 78: Hoare triple {18078#true} ~skip~0 := 0; {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {18078#true} assume !false; {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {18078#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {18078#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {18078#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {18078#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {18078#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {18078#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {18078#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {18078#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {18078#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {18078#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {18078#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {18078#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18078#true} is VALID [2022-04-07 16:10:09,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {18078#true} assume 4416 == #t~mem54;havoc #t~mem54; {18078#true} is VALID [2022-04-07 16:10:09,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {18078#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {18078#true} is VALID [2022-04-07 16:10:09,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {18078#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,106 INFO L290 TraceCheckUtils]: 95: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,106 INFO L290 TraceCheckUtils]: 96: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,106 INFO L290 TraceCheckUtils]: 97: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,106 INFO L290 TraceCheckUtils]: 98: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,107 INFO L290 TraceCheckUtils]: 99: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,107 INFO L290 TraceCheckUtils]: 100: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !false; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,107 INFO L290 TraceCheckUtils]: 101: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,108 INFO L290 TraceCheckUtils]: 102: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,108 INFO L290 TraceCheckUtils]: 103: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,108 INFO L290 TraceCheckUtils]: 104: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,108 INFO L290 TraceCheckUtils]: 105: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,109 INFO L290 TraceCheckUtils]: 106: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,109 INFO L290 TraceCheckUtils]: 107: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,109 INFO L290 TraceCheckUtils]: 108: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,110 INFO L290 TraceCheckUtils]: 109: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,110 INFO L290 TraceCheckUtils]: 110: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,110 INFO L290 TraceCheckUtils]: 111: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,111 INFO L290 TraceCheckUtils]: 112: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,111 INFO L290 TraceCheckUtils]: 113: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,111 INFO L290 TraceCheckUtils]: 114: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,112 INFO L290 TraceCheckUtils]: 115: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,112 INFO L290 TraceCheckUtils]: 116: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {18083#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-07 16:10:09,112 INFO L290 TraceCheckUtils]: 117: Hoare triple {18083#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {18079#false} is VALID [2022-04-07 16:10:09,112 INFO L290 TraceCheckUtils]: 118: Hoare triple {18079#false} assume !false; {18079#false} is VALID [2022-04-07 16:10:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-07 16:10:09,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:09,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505094606] [2022-04-07 16:10:09,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505094606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:09,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:09,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:10:09,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815301356] [2022-04-07 16:10:09,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:09,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-07 16:10:09,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:09,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:09,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:09,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:10:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:10:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:09,184 INFO L87 Difference]: Start difference. First operand 571 states and 832 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:11,206 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-07 16:10:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,146 INFO L93 Difference]: Finished difference Result 1005 states and 1467 transitions. [2022-04-07 16:10:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:10:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-07 16:10:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-07 16:10:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2022-04-07 16:10:12,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 490 transitions. [2022-04-07 16:10:12,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:12,496 INFO L225 Difference]: With dead ends: 1005 [2022-04-07 16:10:12,497 INFO L226 Difference]: Without dead ends: 568 [2022-04-07 16:10:12,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:10:12,498 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:12,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 16:10:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-07 16:10:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-04-07 16:10:12,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:12,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,512 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,513 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,530 INFO L93 Difference]: Finished difference Result 568 states and 822 transitions. [2022-04-07 16:10:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 822 transitions. [2022-04-07 16:10:12,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:12,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:12,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 568 states. [2022-04-07 16:10:12,533 INFO L87 Difference]: Start difference. First operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 568 states. [2022-04-07 16:10:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:12,549 INFO L93 Difference]: Finished difference Result 568 states and 822 transitions. [2022-04-07 16:10:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 822 transitions. [2022-04-07 16:10:12,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:12,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:12,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:12,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 822 transitions. [2022-04-07 16:10:12,568 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 822 transitions. Word has length 119 [2022-04-07 16:10:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:12,568 INFO L478 AbstractCegarLoop]: Abstraction has 568 states and 822 transitions. [2022-04-07 16:10:12,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 822 transitions. [2022-04-07 16:10:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-07 16:10:12,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:12,571 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:12,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 16:10:12,571 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 1 times [2022-04-07 16:10:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:12,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574304404] [2022-04-07 16:10:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:12,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {21023#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21016#true} is VALID [2022-04-07 16:10:12,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {21016#true} assume true; {21016#true} is VALID [2022-04-07 16:10:12,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21016#true} {21016#true} #591#return; {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {21016#true} call ULTIMATE.init(); {21023#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:12,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {21023#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {21016#true} assume true; {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21016#true} {21016#true} #591#return; {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {21016#true} call #t~ret159 := main(); {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {21016#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {21016#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {21016#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {21016#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {21016#true} is VALID [2022-04-07 16:10:12,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {21016#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {21016#true} is VALID [2022-04-07 16:10:12,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {21016#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21016#true} is VALID [2022-04-07 16:10:12,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {21016#true} assume !false; {21016#true} is VALID [2022-04-07 16:10:12,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {21016#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {21016#true} assume 12292 == #t~mem43;havoc #t~mem43; {21016#true} is VALID [2022-04-07 16:10:12,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {21016#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {21016#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {21016#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {21016#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {21016#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {21016#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {21016#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {21016#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {21016#true} is VALID [2022-04-07 16:10:12,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {21016#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {21016#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {21016#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {21016#true} ~skip~0 := 0; {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {21016#true} assume !false; {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {21016#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {21016#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {21016#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {21016#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {21016#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {21016#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {21016#true} assume 4368 == #t~mem48;havoc #t~mem48; {21016#true} is VALID [2022-04-07 16:10:12,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {21016#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {21016#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {21016#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {21016#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {21016#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {21016#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {21016#true} ~skip~0 := 0; {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {21016#true} assume !false; {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {21016#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {21016#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {21016#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {21016#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {21016#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {21016#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {21016#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {21016#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {21016#true} assume 4384 == #t~mem50;havoc #t~mem50; {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {21016#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {21016#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21016#true} is VALID [2022-04-07 16:10:12,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {21016#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {21016#true} is VALID [2022-04-07 16:10:12,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {21016#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,814 INFO L290 TraceCheckUtils]: 66: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,814 INFO L290 TraceCheckUtils]: 67: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:12,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {21021#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21022#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-07 16:10:12,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {21022#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {21017#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {21017#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {21017#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {21017#false} assume !(~ret~0 <= 0); {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {21017#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {21017#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {21017#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {21017#false} ~skip~0 := 0; {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {21017#false} assume !false; {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {21017#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {21017#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {21017#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 83: Hoare triple {21017#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {21017#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {21017#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {21017#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 87: Hoare triple {21017#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {21017#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 89: Hoare triple {21017#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 90: Hoare triple {21017#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 91: Hoare triple {21017#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 92: Hoare triple {21017#false} assume 4416 == #t~mem54;havoc #t~mem54; {21017#false} is VALID [2022-04-07 16:10:12,817 INFO L290 TraceCheckUtils]: 93: Hoare triple {21017#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 94: Hoare triple {21017#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 95: Hoare triple {21017#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 96: Hoare triple {21017#false} assume !(0 == ~tmp___6~0); {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 97: Hoare triple {21017#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 98: Hoare triple {21017#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 99: Hoare triple {21017#false} ~skip~0 := 0; {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 100: Hoare triple {21017#false} assume !false; {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 101: Hoare triple {21017#false} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 102: Hoare triple {21017#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {21017#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {21017#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 105: Hoare triple {21017#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 106: Hoare triple {21017#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {21017#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 108: Hoare triple {21017#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 109: Hoare triple {21017#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 110: Hoare triple {21017#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 111: Hoare triple {21017#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 112: Hoare triple {21017#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 113: Hoare triple {21017#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 114: Hoare triple {21017#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,819 INFO L290 TraceCheckUtils]: 115: Hoare triple {21017#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,820 INFO L290 TraceCheckUtils]: 116: Hoare triple {21017#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21017#false} is VALID [2022-04-07 16:10:12,820 INFO L290 TraceCheckUtils]: 117: Hoare triple {21017#false} assume 4448 == #t~mem58;havoc #t~mem58; {21017#false} is VALID [2022-04-07 16:10:12,820 INFO L290 TraceCheckUtils]: 118: Hoare triple {21017#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21017#false} is VALID [2022-04-07 16:10:12,820 INFO L290 TraceCheckUtils]: 119: Hoare triple {21017#false} assume 4 == ~blastFlag~0; {21017#false} is VALID [2022-04-07 16:10:12,820 INFO L290 TraceCheckUtils]: 120: Hoare triple {21017#false} assume !false; {21017#false} is VALID [2022-04-07 16:10:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-07 16:10:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:12,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574304404] [2022-04-07 16:10:12,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574304404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:12,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:12,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923145607] [2022-04-07 16:10:12,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-07 16:10:12,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:12,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:12,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:12,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:12,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:12,903 INFO L87 Difference]: Start difference. First operand 568 states and 822 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:14,929 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-07 16:10:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:15,969 INFO L93 Difference]: Finished difference Result 1490 states and 2160 transitions. [2022-04-07 16:10:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-07 16:10:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:10:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-07 16:10:15,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-07 16:10:16,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:16,338 INFO L225 Difference]: With dead ends: 1490 [2022-04-07 16:10:16,338 INFO L226 Difference]: Without dead ends: 938 [2022-04-07 16:10:16,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:10:16,340 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 110 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:16,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 282 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-04-07 16:10:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 652. [2022-04-07 16:10:16,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:16,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 938 states. Second operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:16,359 INFO L74 IsIncluded]: Start isIncluded. First operand 938 states. Second operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:16,360 INFO L87 Difference]: Start difference. First operand 938 states. Second operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:16,397 INFO L93 Difference]: Finished difference Result 938 states and 1354 transitions. [2022-04-07 16:10:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1354 transitions. [2022-04-07 16:10:16,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:16,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:16,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 938 states. [2022-04-07 16:10:16,401 INFO L87 Difference]: Start difference. First operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 938 states. [2022-04-07 16:10:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:16,436 INFO L93 Difference]: Finished difference Result 938 states and 1354 transitions. [2022-04-07 16:10:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1354 transitions. [2022-04-07 16:10:16,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:16,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:16,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:16,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 954 transitions. [2022-04-07 16:10:16,459 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 954 transitions. Word has length 121 [2022-04-07 16:10:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:16,459 INFO L478 AbstractCegarLoop]: Abstraction has 652 states and 954 transitions. [2022-04-07 16:10:16,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 954 transitions. [2022-04-07 16:10:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-07 16:10:16,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:16,462 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:16,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 16:10:16,462 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 1 times [2022-04-07 16:10:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:16,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492557282] [2022-04-07 16:10:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:16,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {25359#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {25352#true} is VALID [2022-04-07 16:10:16,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {25352#true} assume true; {25352#true} is VALID [2022-04-07 16:10:16,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25352#true} {25352#true} #591#return; {25352#true} is VALID [2022-04-07 16:10:16,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {25352#true} call ULTIMATE.init(); {25359#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:16,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {25359#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {25352#true} is VALID [2022-04-07 16:10:16,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {25352#true} assume true; {25352#true} is VALID [2022-04-07 16:10:16,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25352#true} {25352#true} #591#return; {25352#true} is VALID [2022-04-07 16:10:16,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {25352#true} call #t~ret159 := main(); {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {25352#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {25352#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {25352#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {25352#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {25352#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {25352#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {25352#true} assume !false; {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {25352#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {25352#true} assume 12292 == #t~mem43;havoc #t~mem43; {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {25352#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {25352#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {25352#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {25352#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {25352#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {25352#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {25352#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {25352#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {25352#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {25352#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {25352#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {25352#true} ~skip~0 := 0; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {25352#true} assume !false; {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {25352#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {25352#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {25352#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {25352#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {25352#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {25352#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {25352#true} assume 4368 == #t~mem48;havoc #t~mem48; {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {25352#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {25352#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {25352#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {25352#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {25352#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {25352#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {25352#true} ~skip~0 := 0; {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {25352#true} assume !false; {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {25352#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {25352#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {25352#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {25352#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {25352#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {25352#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {25352#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {25352#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {25352#true} assume 4384 == #t~mem50;havoc #t~mem50; {25352#true} is VALID [2022-04-07 16:10:16,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {25352#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {25352#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {25352#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {25352#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {25352#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {25352#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {25352#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {25352#true} ~skip~0 := 0; {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {25352#true} assume !false; {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {25352#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {25352#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,718 INFO L290 TraceCheckUtils]: 62: Hoare triple {25352#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {25352#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {25352#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {25352#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {25352#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {25352#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {25352#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 69: Hoare triple {25352#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {25352#true} assume 4400 == #t~mem52;havoc #t~mem52; {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {25352#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {25352#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {25352#true} is VALID [2022-04-07 16:10:16,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {25352#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 74: Hoare triple {25352#true} assume !(~ret~0 <= 0); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {25352#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {25352#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 77: Hoare triple {25352#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 78: Hoare triple {25352#true} ~skip~0 := 0; {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 79: Hoare triple {25352#true} assume !false; {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 80: Hoare triple {25352#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 81: Hoare triple {25352#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {25352#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 83: Hoare triple {25352#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,720 INFO L290 TraceCheckUtils]: 84: Hoare triple {25352#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {25352#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {25352#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 87: Hoare triple {25352#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {25352#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {25352#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 90: Hoare triple {25352#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 91: Hoare triple {25352#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 92: Hoare triple {25352#true} assume 4416 == #t~mem54;havoc #t~mem54; {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 93: Hoare triple {25352#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {25352#true} is VALID [2022-04-07 16:10:16,721 INFO L290 TraceCheckUtils]: 94: Hoare triple {25352#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25352#true} is VALID [2022-04-07 16:10:16,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {25352#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,723 INFO L290 TraceCheckUtils]: 96: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,723 INFO L290 TraceCheckUtils]: 97: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,724 INFO L290 TraceCheckUtils]: 99: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,725 INFO L290 TraceCheckUtils]: 100: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,725 INFO L290 TraceCheckUtils]: 101: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,725 INFO L290 TraceCheckUtils]: 102: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,726 INFO L290 TraceCheckUtils]: 103: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,726 INFO L290 TraceCheckUtils]: 104: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,727 INFO L290 TraceCheckUtils]: 105: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,727 INFO L290 TraceCheckUtils]: 106: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,727 INFO L290 TraceCheckUtils]: 107: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,728 INFO L290 TraceCheckUtils]: 108: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,728 INFO L290 TraceCheckUtils]: 109: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,728 INFO L290 TraceCheckUtils]: 110: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,729 INFO L290 TraceCheckUtils]: 111: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,729 INFO L290 TraceCheckUtils]: 112: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,730 INFO L290 TraceCheckUtils]: 113: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,730 INFO L290 TraceCheckUtils]: 114: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,731 INFO L290 TraceCheckUtils]: 115: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:16,731 INFO L290 TraceCheckUtils]: 116: Hoare triple {25357#(not (= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25358#(not (= |ssl3_connect_#t~mem58| 4448))} is VALID [2022-04-07 16:10:16,731 INFO L290 TraceCheckUtils]: 117: Hoare triple {25358#(not (= |ssl3_connect_#t~mem58| 4448))} assume 4448 == #t~mem58;havoc #t~mem58; {25353#false} is VALID [2022-04-07 16:10:16,731 INFO L290 TraceCheckUtils]: 118: Hoare triple {25353#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {25353#false} is VALID [2022-04-07 16:10:16,731 INFO L290 TraceCheckUtils]: 119: Hoare triple {25353#false} assume 4 == ~blastFlag~0; {25353#false} is VALID [2022-04-07 16:10:16,732 INFO L290 TraceCheckUtils]: 120: Hoare triple {25353#false} assume !false; {25353#false} is VALID [2022-04-07 16:10:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-07 16:10:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:16,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492557282] [2022-04-07 16:10:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492557282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:16,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212978882] [2022-04-07 16:10:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-07 16:10:16,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:16,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:16,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:16,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:16,806 INFO L87 Difference]: Start difference. First operand 652 states and 954 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:18,836 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-07 16:10:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:19,903 INFO L93 Difference]: Finished difference Result 1674 states and 2456 transitions. [2022-04-07 16:10:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:19,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-07 16:10:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:19,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:10:20,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:20,282 INFO L225 Difference]: With dead ends: 1674 [2022-04-07 16:10:20,282 INFO L226 Difference]: Without dead ends: 1038 [2022-04-07 16:10:20,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:10:20,284 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:20,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-04-07 16:10:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 776. [2022-04-07 16:10:20,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:20,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1038 states. Second operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:20,305 INFO L74 IsIncluded]: Start isIncluded. First operand 1038 states. Second operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:20,306 INFO L87 Difference]: Start difference. First operand 1038 states. Second operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:20,351 INFO L93 Difference]: Finished difference Result 1038 states and 1518 transitions. [2022-04-07 16:10:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1518 transitions. [2022-04-07 16:10:20,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:20,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:20,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1038 states. [2022-04-07 16:10:20,355 INFO L87 Difference]: Start difference. First operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1038 states. [2022-04-07 16:10:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:20,391 INFO L93 Difference]: Finished difference Result 1038 states and 1518 transitions. [2022-04-07 16:10:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1518 transitions. [2022-04-07 16:10:20,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:20,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:20,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:20,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1166 transitions. [2022-04-07 16:10:20,424 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1166 transitions. Word has length 121 [2022-04-07 16:10:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:20,425 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 1166 transitions. [2022-04-07 16:10:20,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1166 transitions. [2022-04-07 16:10:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-07 16:10:20,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:20,427 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:20,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 16:10:20,427 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056150, now seen corresponding path program 1 times [2022-04-07 16:10:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:20,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122586596] [2022-04-07 16:10:20,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:10:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:10:20,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {30215#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {30208#true} is VALID [2022-04-07 16:10:20,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {30208#true} assume true; {30208#true} is VALID [2022-04-07 16:10:20,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30208#true} {30208#true} #591#return; {30208#true} is VALID [2022-04-07 16:10:20,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {30208#true} call ULTIMATE.init(); {30215#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:10:20,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {30215#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {30208#true} is VALID [2022-04-07 16:10:20,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {30208#true} assume true; {30208#true} is VALID [2022-04-07 16:10:20,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30208#true} {30208#true} #591#return; {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {30208#true} call #t~ret159 := main(); {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {30208#true} 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(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {30208#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {30208#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~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;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {30208#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 4294967296;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {30208#true} call #t~mem41 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 28 + ~s.offset, 4);havoc #t~mem41; {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {30208#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {30208#true} assume !false; {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {30208#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {30208#true} assume 12292 == #t~mem43;havoc #t~mem43; {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {30208#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem77 := read~int(#t~mem76.base, 64 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 64 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {30208#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {30208#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {30208#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {30208#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {30208#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {30208#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {30208#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {30208#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem84 := read~int(#t~mem83.base, 60 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 60 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 64 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {30208#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {30208#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {30208#true} ~skip~0 := 0; {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {30208#true} assume !false; {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {30208#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {30208#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {30208#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {30208#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {30208#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {30208#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {30208#true} assume 4368 == #t~mem48;havoc #t~mem48; {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {30208#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {30208#true} is VALID [2022-04-07 16:10:20,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {30208#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {30208#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {30208#true} assume (#t~mem86.base + #t~mem86.offset) % 4294967296 != (#t~mem87.base + #t~mem87.offset) % 4294967296;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {30208#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {30208#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {30208#true} ~skip~0 := 0; {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {30208#true} assume !false; {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {30208#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {30208#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {30208#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {30208#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {30208#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {30208#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {30208#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {30208#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {30208#true} assume 4384 == #t~mem50;havoc #t~mem50; {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {30208#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {30208#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {30208#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {30208#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {30208#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {30208#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {30208#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {30208#true} ~skip~0 := 0; {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {30208#true} assume !false; {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {30208#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {30208#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {30208#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {30208#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {30208#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {30208#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {30208#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {30208#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 68: Hoare triple {30208#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 69: Hoare triple {30208#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {30208#true} assume 4400 == #t~mem52;havoc #t~mem52; {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {30208#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 836 + #t~mem90.offset, 4);call #t~mem92 := read~int(#t~mem91.base, 12 + #t~mem91.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {30208#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 4294967296);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {30208#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {30208#true} assume !(~ret~0 <= 0); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {30208#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {30208#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,691 INFO L290 TraceCheckUtils]: 77: Hoare triple {30208#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {30208#true} ~skip~0 := 0; {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {30208#true} assume !false; {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {30208#true} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {30208#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 82: Hoare triple {30208#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {30208#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {30208#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 85: Hoare triple {30208#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {30208#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 87: Hoare triple {30208#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,692 INFO L290 TraceCheckUtils]: 88: Hoare triple {30208#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {30208#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,693 INFO L290 TraceCheckUtils]: 90: Hoare triple {30208#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,693 INFO L290 TraceCheckUtils]: 91: Hoare triple {30208#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30208#true} is VALID [2022-04-07 16:10:20,693 INFO L290 TraceCheckUtils]: 92: Hoare triple {30208#true} assume 4416 == #t~mem54;havoc #t~mem54; {30208#true} is VALID [2022-04-07 16:10:20,693 INFO L290 TraceCheckUtils]: 93: Hoare triple {30208#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {30208#true} is VALID [2022-04-07 16:10:20,693 INFO L290 TraceCheckUtils]: 94: Hoare triple {30208#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30208#true} is VALID [2022-04-07 16:10:20,694 INFO L290 TraceCheckUtils]: 95: Hoare triple {30208#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,695 INFO L290 TraceCheckUtils]: 97: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem149 := read~int(#t~mem148.base, 848 + #t~mem148.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,695 INFO L290 TraceCheckUtils]: 98: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,695 INFO L290 TraceCheckUtils]: 99: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,696 INFO L290 TraceCheckUtils]: 100: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,696 INFO L290 TraceCheckUtils]: 101: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,696 INFO L290 TraceCheckUtils]: 102: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,697 INFO L290 TraceCheckUtils]: 103: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,697 INFO L290 TraceCheckUtils]: 104: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,697 INFO L290 TraceCheckUtils]: 105: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,698 INFO L290 TraceCheckUtils]: 106: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,698 INFO L290 TraceCheckUtils]: 107: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,698 INFO L290 TraceCheckUtils]: 108: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,699 INFO L290 TraceCheckUtils]: 109: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,699 INFO L290 TraceCheckUtils]: 110: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,699 INFO L290 TraceCheckUtils]: 111: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,700 INFO L290 TraceCheckUtils]: 112: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,700 INFO L290 TraceCheckUtils]: 113: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,700 INFO L290 TraceCheckUtils]: 114: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,701 INFO L290 TraceCheckUtils]: 115: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,701 INFO L290 TraceCheckUtils]: 116: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-07 16:10:20,701 INFO L290 TraceCheckUtils]: 117: Hoare triple {30213#(not (= 4449 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30214#(not (= 4449 |ssl3_connect_#t~mem59|))} is VALID [2022-04-07 16:10:20,702 INFO L290 TraceCheckUtils]: 118: Hoare triple {30214#(not (= 4449 |ssl3_connect_#t~mem59|))} assume 4449 == #t~mem59;havoc #t~mem59; {30209#false} is VALID [2022-04-07 16:10:20,702 INFO L290 TraceCheckUtils]: 119: Hoare triple {30209#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {30209#false} is VALID [2022-04-07 16:10:20,702 INFO L290 TraceCheckUtils]: 120: Hoare triple {30209#false} assume 4 == ~blastFlag~0; {30209#false} is VALID [2022-04-07 16:10:20,702 INFO L290 TraceCheckUtils]: 121: Hoare triple {30209#false} assume !false; {30209#false} is VALID [2022-04-07 16:10:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-07 16:10:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:10:20,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122586596] [2022-04-07 16:10:20,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122586596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:10:20,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:10:20,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 16:10:20,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650642786] [2022-04-07 16:10:20,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:10:20,704 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 122 [2022-04-07 16:10:20,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:10:20,704 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-07 16:10:20,767 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-07 16:10:20,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 16:10:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:10:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 16:10:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:10:20,768 INFO L87 Difference]: Start difference. First operand 776 states and 1166 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-07 16:10:22,788 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-07 16:10:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:23,892 INFO L93 Difference]: Finished difference Result 1822 states and 2712 transitions. [2022-04-07 16:10:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:10:23,892 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 122 [2022-04-07 16:10:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:10:23,892 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-07 16:10:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:23,894 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-07 16:10:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-07 16:10:23,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-07 16:10:24,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:10:24,270 INFO L225 Difference]: With dead ends: 1822 [2022-04-07 16:10:24,271 INFO L226 Difference]: Without dead ends: 1062 [2022-04-07 16:10:24,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:10:24,273 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 102 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 16:10:24,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 16:10:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-04-07 16:10:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 804. [2022-04-07 16:10:24,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:10:24,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1062 states. Second operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,296 INFO L74 IsIncluded]: Start isIncluded. First operand 1062 states. Second operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,297 INFO L87 Difference]: Start difference. First operand 1062 states. Second operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:24,344 INFO L93 Difference]: Finished difference Result 1062 states and 1562 transitions. [2022-04-07 16:10:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1562 transitions. [2022-04-07 16:10:24,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:24,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:24,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1062 states. [2022-04-07 16:10:24,348 INFO L87 Difference]: Start difference. First operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1062 states. [2022-04-07 16:10:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:10:24,396 INFO L93 Difference]: Finished difference Result 1062 states and 1562 transitions. [2022-04-07 16:10:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1562 transitions. [2022-04-07 16:10:24,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:10:24,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:10:24,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:10:24,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:10:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1218 transitions. [2022-04-07 16:10:24,431 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1218 transitions. Word has length 122 [2022-04-07 16:10:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:10:24,431 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 1218 transitions. [2022-04-07 16:10:24,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:10:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1218 transitions. [2022-04-07 16:10:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-07 16:10:24,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:10:24,434 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:24,434 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 16:10:24,434 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:10:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:10:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-04-07 16:10:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:10:24,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596481669] [2022-04-07 16:10:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:10:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:10:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:10:26,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 16:10:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:10:26,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 16:10:26,718 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 16:10:26,719 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:10:26,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 16:10:26,724 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:10:26,727 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:10:26,836 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-07 16:10:26,837 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1133 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1678 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-07 16:10:26,838 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1136-2 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1136 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1678-1 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-07 16:10:26,839 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1144 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1153-1 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1154 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1662 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1662-2 has no Hoare annotation [2022-04-07 16:10:26,840 WARN L170 areAnnotationChecker]: L1157 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1159 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1162 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1267 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1165 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1267-2 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-07 16:10:26,841 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1281 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1279-2 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1313 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1177 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1292 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1313-2 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1299 has no Hoare annotation [2022-04-07 16:10:26,842 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1325 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1183 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1591 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1334-2 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1344 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1353 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-07 16:10:26,843 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1627-1 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1344-2 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1353-2 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1357 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1357-2 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1374 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1195 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-07 16:10:26,844 WARN L170 areAnnotationChecker]: L1631 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1629-2 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1374-2 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1397 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-07 16:10:26,845 WARN L170 areAnnotationChecker]: L1402 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1210 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1435 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-07 16:10:26,846 WARN L170 areAnnotationChecker]: L1423-2 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1446 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1452-2 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1463 has no Hoare annotation [2022-04-07 16:10:26,847 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1475 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1237 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1483 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1483-2 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1243 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-07 16:10:26,848 WARN L170 areAnnotationChecker]: L1489 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1515 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1513-1 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-07 16:10:26,849 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1535 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1535-2 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1544 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-07 16:10:26,850 WARN L170 areAnnotationChecker]: L1548 has no Hoare annotation [2022-04-07 16:10:26,851 WARN L170 areAnnotationChecker]: L1544-2 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1561 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1561-2 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1566 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1566-2 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1573 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1573-2 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-07 16:10:26,852 WARN L170 areAnnotationChecker]: L1581 has no Hoare annotation [2022-04-07 16:10:26,852 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-07 16:10:26,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:10:26 BoogieIcfgContainer [2022-04-07 16:10:26,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:10:26,856 INFO L158 Benchmark]: Toolchain (without parser) took 64847.79ms. Allocated memory was 168.8MB in the beginning and 295.7MB in the end (delta: 126.9MB). Free memory was 116.0MB in the beginning and 167.0MB in the end (delta: -50.9MB). Peak memory consumption was 172.4MB. Max. memory is 8.0GB. [2022-04-07 16:10:26,857 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 168.8MB. Free memory was 134.5MB in the beginning and 134.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:10:26,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.37ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 115.8MB in the beginning and 157.9MB in the end (delta: -42.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-07 16:10:26,857 INFO L158 Benchmark]: Boogie Preprocessor took 129.82ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 148.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 16:10:26,857 INFO L158 Benchmark]: RCFGBuilder took 2419.40ms. Allocated memory is still 203.4MB. Free memory was 148.4MB in the beginning and 114.9MB in the end (delta: 33.6MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2022-04-07 16:10:26,857 INFO L158 Benchmark]: TraceAbstraction took 61639.16ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 114.3MB in the beginning and 167.0MB in the end (delta: -52.6MB). Peak memory consumption was 135.1MB. Max. memory is 8.0GB. [2022-04-07 16:10:26,859 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.17ms. Allocated memory is still 168.8MB. Free memory was 134.5MB in the beginning and 134.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 653.37ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 115.8MB in the beginning and 157.9MB in the end (delta: -42.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 129.82ms. Allocated memory is still 203.4MB. Free memory was 157.9MB in the beginning and 148.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2419.40ms. Allocated memory is still 203.4MB. Free memory was 148.4MB in the beginning and 114.9MB in the end (delta: 33.6MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. * TraceAbstraction took 61639.16ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 114.3MB in the beginning and 167.0MB in the end (delta: -52.6MB). Peak memory consumption was 135.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1668]: 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 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967307, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) VAL [init=1, s={-10:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->info_callback={0:13}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1272] EXPR s->version VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->version=6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->init_buf={0:-1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->bbio={0:-17}, s->wbio={0:17}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1349] s->init_num = 0 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:13}, ((s->s3)->tmp.new_cipher)->algorithms=4294967356, (s->s3)->tmp.new_cipher={-9:0}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1362] COND FALSE !(ret <= 0) VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=-19, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1668] reach_error() VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=-19, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.4s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 52.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1214 SdHoareTripleChecker+Valid, 35.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1214 mSDsluCounter, 6047 SdHoareTripleChecker+Invalid, 35.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3226 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5089 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 2821 mSDtfsCounter, 5089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=15, InterpolantAutomatonStates: 70, 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, 15 MinimizatonAttempts, 1188 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1396 NumberOfCodeBlocks, 1396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 2872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 995/995 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-07 16:10:26,909 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...