/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.04.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:24:53,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:24:53,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:24:53,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:24:53,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:24:53,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:24:53,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:24:53,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:24:53,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:24:53,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:24:53,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:24:53,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:24:53,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:24:53,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:24:53,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:24:53,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:24:53,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:24:53,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:24:53,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:24:53,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:24:53,602 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:24:53,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:24:53,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:24:53,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:24:53,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:24:53,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:24:53,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:24:53,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:24:53,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:24:53,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:24:53,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:24:53,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:24:53,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:24:53,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:24:53,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:24:53,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:24:53,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:24:53,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:24:53,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:24:53,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:24:53,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:24:53,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:24:53,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:24:53,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:24:53,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:24:53,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:24:53,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:24:53,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:24:53,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:24:53,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:24:53,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:24:53,652 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:24:53,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:24:53,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:24:53,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:24:53,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:24:53,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:24:53,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:24:53,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:24:53,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:24:53,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:24:53,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:24:53,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:24:53,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:24:53,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:24:53,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:24:53,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:24:53,656 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:24:53,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:24:53,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:24:53,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:24:53,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:24:53,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:24:53,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:24:53,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:24:53,884 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:24:53,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c [2022-04-27 15:24:53,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f82df6d/7c04cf83677d4eadabf4b232981971e1/FLAG5b0e27cb0 [2022-04-27 15:24:54,377 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:24:54,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-1.c [2022-04-27 15:24:54,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f82df6d/7c04cf83677d4eadabf4b232981971e1/FLAG5b0e27cb0 [2022-04-27 15:24:54,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f82df6d/7c04cf83677d4eadabf4b232981971e1 [2022-04-27 15:24:54,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:24:54,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:24:54,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:24:54,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:24:54,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:24:54,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:24:54" (1/1) ... [2022-04-27 15:24:54,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5aafb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:54, skipping insertion in model container [2022-04-27 15:24:54,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:24:54" (1/1) ... [2022-04-27 15:24:54,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:24:54,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:24:55,324 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.04.i.cil-1.c[65405,65418] [2022-04-27 15:24:55,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:24:55,342 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:24:55,471 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.04.i.cil-1.c[65405,65418] [2022-04-27 15:24:55,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:24:55,496 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:24:55,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55 WrapperNode [2022-04-27 15:24:55,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:24:55,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:24:55,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:24:55,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:24:55,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:24:55,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:24:55,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:24:55,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:24:55,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (1/1) ... [2022-04-27 15:24:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:24:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:24:55,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:24:55,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:24:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-27 15:24:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:24:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:24:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:24:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:24:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:24:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:24:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:24:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-27 15:24:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:24:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:24:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:24:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:24:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:24:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:24:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:24:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:24:55,874 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:24:55,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:24:57,223 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:24:57,652 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-27 15:24:57,652 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-27 15:24:57,663 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:24:57,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:24:57,670 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:24:57,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:24:57 BoogieIcfgContainer [2022-04-27 15:24:57,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:24:57,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:24:57,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:24:57,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:24:57,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:24:54" (1/3) ... [2022-04-27 15:24:57,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d24bbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:24:57, skipping insertion in model container [2022-04-27 15:24:57,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:24:55" (2/3) ... [2022-04-27 15:24:57,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d24bbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:24:57, skipping insertion in model container [2022-04-27 15:24:57,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:24:57" (3/3) ... [2022-04-27 15:24:57,678 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-04-27 15:24:57,690 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:24:57,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:24:57,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:24:57,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52423161, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f28a75a [2022-04-27 15:24:57,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:24:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:24:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:24:57,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:24:57,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:24:57,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:24:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:24:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-27 15:24:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:24:57,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464182487] [2022-04-27 15:24:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:24:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:24:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:58,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:24:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:24:58,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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); {141#true} is VALID [2022-04-27 15:24:58,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-27 15:24:58,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-27 15:24:58,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(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-27 15:24:58,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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); {141#true} is VALID [2022-04-27 15:24:58,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-27 15:24:58,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-27 15:24:58,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-27 15:24:58,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#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; {141#true} is VALID [2022-04-27 15:24:58,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-27 15:24:58,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:58,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:58,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:58,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 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)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:58,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:24:58,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-27 15:24:58,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-27 15:24:58,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-27 15:24:58,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-27 15:24:58,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-27 15:24:58,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-27 15:24:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:24:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:24:58,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464182487] [2022-04-27 15:24:58,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464182487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:24:58,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:24:58,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:24:58,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962848632] [2022-04-27 15:24:58,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:24:58,438 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-27 15:24:58,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:24:58,444 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-27 15:24:58,488 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-27 15:24:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:24:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:24:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:24:58,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:24:58,517 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 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-27 15:25:00,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:01,905 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-27 15:25:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:01,905 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-27 15:25:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:01,907 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-27 15:25:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:25:01,921 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-27 15:25:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:25:01,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-27 15:25:02,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:02,311 INFO L225 Difference]: With dead ends: 267 [2022-04-27 15:25:02,311 INFO L226 Difference]: Without dead ends: 122 [2022-04-27 15:25:02,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:02,321 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:02,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-27 15:25:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-27 15:25:02,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:02,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,369 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,370 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:02,376 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-27 15:25:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-27 15:25:02,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:02,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:02,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-27 15:25:02,378 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-27 15:25:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:02,383 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-27 15:25:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-27 15:25:02,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:02,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:02,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:02,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-27 15:25:02,390 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-27 15:25:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:02,391 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-27 15:25:02,391 INFO L496 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-27 15:25:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-27 15:25:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 15:25:02,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:02,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:02,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:25:02,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-27 15:25:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:02,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317646139] [2022-04-27 15:25:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:02,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#(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); {855#true} is VALID [2022-04-27 15:25:02,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-27 15:25:02,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-27 15:25:02,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {861#(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-27 15:25:02,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#(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); {855#true} is VALID [2022-04-27 15:25:02,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2022-04-27 15:25:02,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #593#return; {855#true} is VALID [2022-04-27 15:25:02,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#true} call #t~ret158 := main(); {855#true} is VALID [2022-04-27 15:25:02,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#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; {855#true} is VALID [2022-04-27 15:25:02,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {855#true} is VALID [2022-04-27 15:25:02,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {855#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= 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)))); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(= 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~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !false; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {860#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-27 15:25:02,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {860#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {856#false} is VALID [2022-04-27 15:25:02,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-04-27 15:25:02,656 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-27 15:25:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317646139] [2022-04-27 15:25:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317646139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:02,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:02,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583550037] [2022-04-27 15:25:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:02,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-27 15:25:02,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:02,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:02,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:02,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:02,702 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:04,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:05,429 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-27 15:25:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-27 15:25:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-27 15:25:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-27 15:25:05,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-27 15:25:05,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:05,829 INFO L225 Difference]: With dead ends: 327 [2022-04-27 15:25:05,830 INFO L226 Difference]: Without dead ends: 222 [2022-04-27 15:25:05,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:05,831 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:05,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:25:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-27 15:25:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-27 15:25:05,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:05,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,846 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,847 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:05,855 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-27 15:25:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-27 15:25:05,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:05,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:05,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-27 15:25:05,858 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-27 15:25:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:05,866 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-27 15:25:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-27 15:25:05,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:05,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:05,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:05,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-27 15:25:05,875 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-27 15:25:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:05,876 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-27 15:25:05,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-27 15:25:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 15:25:05,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:05,878 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:05,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:25:05,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-27 15:25:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:05,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642617280] [2022-04-27 15:25:05,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:06,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {1959#(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); {1952#true} is VALID [2022-04-27 15:25:06,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-27 15:25:06,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-27 15:25:06,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {1952#true} call ULTIMATE.init(); {1959#(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-27 15:25:06,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1959#(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); {1952#true} is VALID [2022-04-27 15:25:06,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {1952#true} assume true; {1952#true} is VALID [2022-04-27 15:25:06,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1952#true} {1952#true} #593#return; {1952#true} is VALID [2022-04-27 15:25:06,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {1952#true} call #t~ret158 := main(); {1952#true} is VALID [2022-04-27 15:25:06,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {1952#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; {1952#true} is VALID [2022-04-27 15:25:06,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {1952#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1952#true} is VALID [2022-04-27 15:25:06,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {1952#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {1952#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1952#true} is VALID [2022-04-27 15:25:06,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {1952#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1952#true} is VALID [2022-04-27 15:25:06,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {1952#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1952#true} is VALID [2022-04-27 15:25:06,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-27 15:25:06,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1952#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1952#true} assume 12292 == #t~mem49;havoc #t~mem49; {1952#true} is VALID [2022-04-27 15:25:06,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1952#true} is VALID [2022-04-27 15:25:06,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1952#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1952#true} is VALID [2022-04-27 15:25:06,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {1952#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {1952#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {1952#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1952#true} is VALID [2022-04-27 15:25:06,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {1952#true} assume !(0 == ~tmp___4~0); {1952#true} is VALID [2022-04-27 15:25:06,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {1952#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {1952#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {1952#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1952#true} is VALID [2022-04-27 15:25:06,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {1952#true} ~skip~0 := 0; {1952#true} is VALID [2022-04-27 15:25:06,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {1952#true} assume !false; {1952#true} is VALID [2022-04-27 15:25:06,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {1952#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {1952#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {1952#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {1952#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {1952#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {1952#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1952#true} is VALID [2022-04-27 15:25:06,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {1952#true} assume 4368 == #t~mem54;havoc #t~mem54; {1952#true} is VALID [2022-04-27 15:25:06,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {1952#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {1952#true} is VALID [2022-04-27 15:25:06,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {1952#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1952#true} is VALID [2022-04-27 15:25:06,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {1952#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:06,259 INFO L290 TraceCheckUtils]: 48: Hoare triple {1957#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1958#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-27 15:25:06,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {1958#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {1953#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {1953#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {1953#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {1953#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {1953#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {1953#false} assume 4432 == #t~mem62;havoc #t~mem62; {1953#false} is VALID [2022-04-27 15:25:06,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {1953#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1953#false} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {1953#false} assume 4 == ~blastFlag~0; {1953#false} is VALID [2022-04-27 15:25:06,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {1953#false} assume !false; {1953#false} is VALID [2022-04-27 15:25:06,271 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-27 15:25:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:06,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642617280] [2022-04-27 15:25:06,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642617280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:06,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:06,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:06,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618181581] [2022-04-27 15:25:06,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:06,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 15:25:06,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:06,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:06,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:06,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:06,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:06,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:06,339 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:08,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:09,424 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-04-27 15:25:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 15:25:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-27 15:25:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-27 15:25:09,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-27 15:25:09,741 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-27 15:25:09,746 INFO L225 Difference]: With dead ends: 362 [2022-04-27 15:25:09,746 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 15:25:09,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:09,748 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:09,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 15:25:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-27 15:25:09,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:09,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,759 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,760 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:09,768 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-27 15:25:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-27 15:25:09,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:09,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:09,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-27 15:25:09,770 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-27 15:25:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:09,778 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-27 15:25:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-27 15:25:09,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:09,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:09,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:09,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-27 15:25:09,786 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-27 15:25:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:09,787 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-27 15:25:09,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-27 15:25:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 15:25:09,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:09,788 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-27 15:25:09,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:25:09,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 2 times [2022-04-27 15:25:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181138711] [2022-04-27 15:25:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:09,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(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); {3181#true} is VALID [2022-04-27 15:25:09,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-27 15:25:09,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3181#true} {3181#true} #593#return; {3181#true} is VALID [2022-04-27 15:25:09,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3188#(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-27 15:25:09,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(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); {3181#true} is VALID [2022-04-27 15:25:09,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-27 15:25:09,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #593#return; {3181#true} is VALID [2022-04-27 15:25:09,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret158 := main(); {3181#true} is VALID [2022-04-27 15:25:09,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {3181#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; {3181#true} is VALID [2022-04-27 15:25:09,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {3181#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {3181#true} is VALID [2022-04-27 15:25:09,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {3181#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {3181#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {3181#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {3181#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {3181#true} assume !false; {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {3181#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {3181#true} assume 12292 == #t~mem49;havoc #t~mem49; {3181#true} is VALID [2022-04-27 15:25:09,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {3181#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {3181#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {3181#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {3181#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {3181#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {3181#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {3181#true} assume !(0 == ~tmp___4~0); {3181#true} is VALID [2022-04-27 15:25:09,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {3181#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {3181#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {3181#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {3181#true} ~skip~0 := 0; {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {3181#true} assume !false; {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {3181#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {3181#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {3181#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {3181#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {3181#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {3181#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3181#true} is VALID [2022-04-27 15:25:09,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {3181#true} assume 4368 == #t~mem54;havoc #t~mem54; {3181#true} is VALID [2022-04-27 15:25:09,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {3181#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {3181#true} is VALID [2022-04-27 15:25:09,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {3181#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3181#true} is VALID [2022-04-27 15:25:09,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {3181#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:09,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:09,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:10,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:10,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:10,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:10,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3187#(= |ssl3_connect_#t~mem49| 4384)} is VALID [2022-04-27 15:25:10,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {3187#(= |ssl3_connect_#t~mem49| 4384)} assume 12292 == #t~mem49;havoc #t~mem49; {3182#false} is VALID [2022-04-27 15:25:10,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {3182#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {3182#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {3182#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {3182#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {3182#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {3182#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {3182#false} assume !(0 == ~tmp___4~0); {3182#false} is VALID [2022-04-27 15:25:10,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {3182#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {3182#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {3182#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {3182#false} is VALID [2022-04-27 15:25:10,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {3182#false} ~skip~0 := 0; {3182#false} is VALID [2022-04-27 15:25:10,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-27 15:25:10,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {3182#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {3182#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {3182#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {3182#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {3182#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {3182#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {3182#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {3182#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {3182#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {3182#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {3182#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {3182#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {3182#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {3182#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3182#false} is VALID [2022-04-27 15:25:10,020 INFO L290 TraceCheckUtils]: 69: Hoare triple {3182#false} assume 4432 == #t~mem62;havoc #t~mem62; {3182#false} is VALID [2022-04-27 15:25:10,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {3182#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {3182#false} is VALID [2022-04-27 15:25:10,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {3182#false} assume 4 == ~blastFlag~0; {3182#false} is VALID [2022-04-27 15:25:10,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-27 15:25:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:25:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:10,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181138711] [2022-04-27 15:25:10,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181138711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:10,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:10,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265036764] [2022-04-27 15:25:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:10,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:25:10,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:10,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:10,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:10,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:10,096 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:12,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:13,142 INFO L93 Difference]: Finished difference Result 379 states and 565 transitions. [2022-04-27 15:25:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:25:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-27 15:25:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-27 15:25:13,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-27 15:25:13,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:13,429 INFO L225 Difference]: With dead ends: 379 [2022-04-27 15:25:13,429 INFO L226 Difference]: Without dead ends: 256 [2022-04-27 15:25:13,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:13,430 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 37 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 484 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-27 15:25:13,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 484 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-27 15:25:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2022-04-27 15:25:13,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:13,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,441 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,442 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:13,450 INFO L93 Difference]: Finished difference Result 256 states and 376 transitions. [2022-04-27 15:25:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2022-04-27 15:25:13,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:13,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:13,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-27 15:25:13,452 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-27 15:25:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:13,458 INFO L93 Difference]: Finished difference Result 256 states and 376 transitions. [2022-04-27 15:25:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2022-04-27 15:25:13,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:13,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:13,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:13,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4936170212765958) internal successors, (351), 235 states have internal predecessors, (351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 355 transitions. [2022-04-27 15:25:13,474 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 355 transitions. Word has length 73 [2022-04-27 15:25:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:13,474 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 355 transitions. [2022-04-27 15:25:13,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 355 transitions. [2022-04-27 15:25:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 15:25:13,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:13,476 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-27 15:25:13,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:25:13,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-27 15:25:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889694404] [2022-04-27 15:25:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:13,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {4432#(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); {4425#true} is VALID [2022-04-27 15:25:13,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {4425#true} assume true; {4425#true} is VALID [2022-04-27 15:25:13,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4425#true} {4425#true} #593#return; {4425#true} is VALID [2022-04-27 15:25:13,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {4425#true} call ULTIMATE.init(); {4432#(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-27 15:25:13,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {4432#(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); {4425#true} is VALID [2022-04-27 15:25:13,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {4425#true} assume true; {4425#true} is VALID [2022-04-27 15:25:13,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4425#true} {4425#true} #593#return; {4425#true} is VALID [2022-04-27 15:25:13,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {4425#true} call #t~ret158 := main(); {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {4425#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; {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L272 TraceCheckUtils]: 6: Hoare triple {4425#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {4425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {4425#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {4425#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {4425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4425#true} is VALID [2022-04-27 15:25:13,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {4425#true} assume !false; {4425#true} is VALID [2022-04-27 15:25:13,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {4425#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {4425#true} assume 12292 == #t~mem49;havoc #t~mem49; {4425#true} is VALID [2022-04-27 15:25:13,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {4425#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4425#true} is VALID [2022-04-27 15:25:13,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {4425#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {4425#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4425#true} is VALID [2022-04-27 15:25:13,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {4425#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {4425#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {4425#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4425#true} is VALID [2022-04-27 15:25:13,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {4425#true} assume !(0 == ~tmp___4~0); {4425#true} is VALID [2022-04-27 15:25:13,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {4425#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {4425#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {4425#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4425#true} is VALID [2022-04-27 15:25:13,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {4425#true} ~skip~0 := 0; {4425#true} is VALID [2022-04-27 15:25:13,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {4425#true} assume !false; {4425#true} is VALID [2022-04-27 15:25:13,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {4425#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {4425#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {4425#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {4425#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {4425#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {4425#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {4425#true} assume 4368 == #t~mem54;havoc #t~mem54; {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {4425#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4425#true} is VALID [2022-04-27 15:25:13,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {4425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4425#true} is VALID [2022-04-27 15:25:13,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {4425#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:13,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {4430#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4431#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-27 15:25:13,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {4426#false} is VALID [2022-04-27 15:25:13,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {4426#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {4426#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {4426#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {4426#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {4426#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {4426#false} assume !(0 == ~tmp___4~0); {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {4426#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {4426#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {4426#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4426#false} is VALID [2022-04-27 15:25:13,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {4426#false} ~skip~0 := 0; {4426#false} is VALID [2022-04-27 15:25:13,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {4426#false} assume !false; {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {4426#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {4426#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {4426#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {4426#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {4426#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {4426#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {4426#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {4426#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {4426#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {4426#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {4426#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 66: Hoare triple {4426#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {4426#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 68: Hoare triple {4426#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {4426#false} assume 4432 == #t~mem62;havoc #t~mem62; {4426#false} is VALID [2022-04-27 15:25:13,747 INFO L290 TraceCheckUtils]: 70: Hoare triple {4426#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4426#false} is VALID [2022-04-27 15:25:13,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {4426#false} assume 4 == ~blastFlag~0; {4426#false} is VALID [2022-04-27 15:25:13,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {4426#false} assume !false; {4426#false} is VALID [2022-04-27 15:25:13,750 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-27 15:25:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:13,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889694404] [2022-04-27 15:25:13,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889694404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:13,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:13,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768006356] [2022-04-27 15:25:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:25:13,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:13,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:13,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:13,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:13,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:13,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:13,813 INFO L87 Difference]: Start difference. First operand 240 states and 355 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:15,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:16,885 INFO L93 Difference]: Finished difference Result 647 states and 966 transitions. [2022-04-27 15:25:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-27 15:25:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-27 15:25:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-27 15:25:16,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-27 15:25:17,227 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-27 15:25:17,239 INFO L225 Difference]: With dead ends: 647 [2022-04-27 15:25:17,239 INFO L226 Difference]: Without dead ends: 423 [2022-04-27 15:25:17,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:17,240 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:17,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-27 15:25:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 264. [2022-04-27 15:25:17,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:17,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,254 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,254 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:17,265 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-27 15:25:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-27 15:25:17,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:17,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:17,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:25:17,268 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:25:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:17,279 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2022-04-27 15:25:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2022-04-27 15:25:17,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:17,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:17,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:17,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4903474903474903) internal successors, (386), 259 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 390 transitions. [2022-04-27 15:25:17,286 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 390 transitions. Word has length 73 [2022-04-27 15:25:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:17,287 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 390 transitions. [2022-04-27 15:25:17,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 390 transitions. [2022-04-27 15:25:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 15:25:17,288 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:17,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-27 15:25:17,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:25:17,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-27 15:25:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404643072] [2022-04-27 15:25:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:17,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {6350#(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); {6343#true} is VALID [2022-04-27 15:25:17,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-27 15:25:17,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6343#true} {6343#true} #593#return; {6343#true} is VALID [2022-04-27 15:25:17,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6350#(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-27 15:25:17,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {6350#(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); {6343#true} is VALID [2022-04-27 15:25:17,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-27 15:25:17,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6343#true} {6343#true} #593#return; {6343#true} is VALID [2022-04-27 15:25:17,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {6343#true} call #t~ret158 := main(); {6343#true} is VALID [2022-04-27 15:25:17,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {6343#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; {6343#true} is VALID [2022-04-27 15:25:17,490 INFO L272 TraceCheckUtils]: 6: Hoare triple {6343#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {6343#true} is VALID [2022-04-27 15:25:17,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {6343#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {6343#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {6343#true} is VALID [2022-04-27 15:25:17,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {6343#true} is VALID [2022-04-27 15:25:17,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {6343#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {6343#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#true} assume 12292 == #t~mem49;havoc #t~mem49; {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {6343#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {6343#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {6343#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {6343#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {6343#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {6343#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {6343#true} assume !(0 == ~tmp___4~0); {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {6343#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {6343#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {6343#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {6343#true} ~skip~0 := 0; {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-27 15:25:17,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {6343#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {6343#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {6343#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {6343#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {6343#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {6343#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6343#true} is VALID [2022-04-27 15:25:17,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {6343#true} assume 4368 == #t~mem54;havoc #t~mem54; {6343#true} is VALID [2022-04-27 15:25:17,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {6343#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {6343#true} is VALID [2022-04-27 15:25:17,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {6343#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {6343#true} is VALID [2022-04-27 15:25:17,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {6343#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:17,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {6348#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6349#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-27 15:25:17,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {6349#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {6344#false} is VALID [2022-04-27 15:25:17,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {6344#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {6344#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6344#false} is VALID [2022-04-27 15:25:17,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {6344#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {6344#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {6344#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {6344#false} assume !(0 == ~tmp___4~0); {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {6344#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {6344#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {6344#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {6344#false} ~skip~0 := 0; {6344#false} is VALID [2022-04-27 15:25:17,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {6344#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {6344#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {6344#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {6344#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {6344#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {6344#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {6344#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {6344#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {6344#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {6344#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {6344#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {6344#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {6344#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {6344#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6344#false} is VALID [2022-04-27 15:25:17,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {6344#false} assume 4432 == #t~mem62;havoc #t~mem62; {6344#false} is VALID [2022-04-27 15:25:17,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {6344#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {6344#false} is VALID [2022-04-27 15:25:17,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {6344#false} assume 4 == ~blastFlag~0; {6344#false} is VALID [2022-04-27 15:25:17,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-27 15:25:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:25:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404643072] [2022-04-27 15:25:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404643072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:17,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:17,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258253641] [2022-04-27 15:25:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-27 15:25:17,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:17,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:17,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:17,589 INFO L87 Difference]: Start difference. First operand 264 states and 390 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:19,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:20,542 INFO L93 Difference]: Finished difference Result 415 states and 615 transitions. [2022-04-27 15:25:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-27 15:25:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-27 15:25:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-27 15:25:20,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 382 transitions. [2022-04-27 15:25:20,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:20,878 INFO L225 Difference]: With dead ends: 415 [2022-04-27 15:25:20,878 INFO L226 Difference]: Without dead ends: 280 [2022-04-27 15:25:20,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:20,879 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:20,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-27 15:25:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-27 15:25:20,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:20,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,889 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,889 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:20,895 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-27 15:25:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-27 15:25:20,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:20,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:20,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 15:25:20,897 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 15:25:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:20,902 INFO L93 Difference]: Finished difference Result 280 states and 410 transitions. [2022-04-27 15:25:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2022-04-27 15:25:20,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:20,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:20,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:20,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4864864864864864) internal successors, (385), 259 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 389 transitions. [2022-04-27 15:25:20,909 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 389 transitions. Word has length 74 [2022-04-27 15:25:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:20,910 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 389 transitions. [2022-04-27 15:25:20,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 389 transitions. [2022-04-27 15:25:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 15:25:20,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:20,913 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-27 15:25:20,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:25:20,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-27 15:25:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:20,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718122812] [2022-04-27 15:25:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:21,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {7707#(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); {7700#true} is VALID [2022-04-27 15:25:21,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {7700#true} assume true; {7700#true} is VALID [2022-04-27 15:25:21,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7700#true} {7700#true} #593#return; {7700#true} is VALID [2022-04-27 15:25:21,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {7700#true} call ULTIMATE.init(); {7707#(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-27 15:25:21,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {7707#(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); {7700#true} is VALID [2022-04-27 15:25:21,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {7700#true} assume true; {7700#true} is VALID [2022-04-27 15:25:21,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7700#true} {7700#true} #593#return; {7700#true} is VALID [2022-04-27 15:25:21,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {7700#true} call #t~ret158 := main(); {7700#true} is VALID [2022-04-27 15:25:21,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {7700#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; {7700#true} is VALID [2022-04-27 15:25:21,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {7700#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7700#true} is VALID [2022-04-27 15:25:21,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {7700#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {7700#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7700#true} is VALID [2022-04-27 15:25:21,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {7700#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7700#true} is VALID [2022-04-27 15:25:21,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {7700#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7700#true} is VALID [2022-04-27 15:25:21,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {7700#true} assume !false; {7700#true} is VALID [2022-04-27 15:25:21,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {7700#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {7700#true} assume 12292 == #t~mem49;havoc #t~mem49; {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {7700#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {7700#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {7700#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {7700#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {7700#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {7700#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {7700#true} assume !(0 == ~tmp___4~0); {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {7700#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {7700#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {7700#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {7700#true} ~skip~0 := 0; {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {7700#true} assume !false; {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {7700#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {7700#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {7700#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {7700#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {7700#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {7700#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7700#true} is VALID [2022-04-27 15:25:21,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {7700#true} assume 4368 == #t~mem54;havoc #t~mem54; {7700#true} is VALID [2022-04-27 15:25:21,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {7700#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7700#true} is VALID [2022-04-27 15:25:21,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {7700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7700#true} is VALID [2022-04-27 15:25:21,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {7700#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:21,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {7705#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7706#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-27 15:25:21,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {7706#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {7701#false} is VALID [2022-04-27 15:25:21,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {7701#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {7701#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7701#false} is VALID [2022-04-27 15:25:21,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {7701#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {7701#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {7701#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {7701#false} assume !(0 == ~tmp___4~0); {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {7701#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {7701#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {7701#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {7701#false} ~skip~0 := 0; {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {7701#false} assume !false; {7701#false} is VALID [2022-04-27 15:25:21,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {7701#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {7701#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {7701#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {7701#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {7701#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {7701#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {7701#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {7701#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {7701#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,139 INFO L290 TraceCheckUtils]: 66: Hoare triple {7701#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {7701#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {7701#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {7701#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {7701#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {7701#false} assume 4432 == #t~mem62;havoc #t~mem62; {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {7701#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {7701#false} assume 4 == ~blastFlag~0; {7701#false} is VALID [2022-04-27 15:25:21,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {7701#false} assume !false; {7701#false} is VALID [2022-04-27 15:25:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:25:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:21,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718122812] [2022-04-27 15:25:21,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718122812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:21,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:21,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028481447] [2022-04-27 15:25:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:21,143 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-27 15:25:21,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:21,144 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-27 15:25:21,210 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-27 15:25:21,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:21,211 INFO L87 Difference]: Start difference. First operand 264 states and 389 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-27 15:25:23,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-27 15:25:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:24,174 INFO L93 Difference]: Finished difference Result 415 states and 613 transitions. [2022-04-27 15:25:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:24,175 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-27 15:25:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:24,175 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-27 15:25:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-27 15:25:24,178 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-27 15:25:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-27 15:25:24,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 381 transitions. [2022-04-27 15:25:24,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:24,481 INFO L225 Difference]: With dead ends: 415 [2022-04-27 15:25:24,482 INFO L226 Difference]: Without dead ends: 280 [2022-04-27 15:25:24,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:24,483 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:24,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-27 15:25:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-27 15:25:24,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:24,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:24,493 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:24,494 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:24,499 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-27 15:25:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-27 15:25:24,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:24,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:24,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 15:25:24,501 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 15:25:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:24,507 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2022-04-27 15:25:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-04-27 15:25:24,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:24,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:24,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:24,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-27 15:25:24,514 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 75 [2022-04-27 15:25:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:24,514 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-27 15:25:24,514 INFO L496 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-27 15:25:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-27 15:25:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 15:25:24,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:24,518 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:24,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:25:24,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-27 15:25:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020732576] [2022-04-27 15:25:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:24,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:24,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {9064#(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); {9057#true} is VALID [2022-04-27 15:25:24,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {9057#true} assume true; {9057#true} is VALID [2022-04-27 15:25:24,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9057#true} {9057#true} #593#return; {9057#true} is VALID [2022-04-27 15:25:24,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {9057#true} call ULTIMATE.init(); {9064#(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-27 15:25:24,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {9064#(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); {9057#true} is VALID [2022-04-27 15:25:24,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {9057#true} assume true; {9057#true} is VALID [2022-04-27 15:25:24,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9057#true} {9057#true} #593#return; {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {9057#true} call #t~ret158 := main(); {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {9057#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; {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L272 TraceCheckUtils]: 6: Hoare triple {9057#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {9057#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {9057#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {9057#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9057#true} is VALID [2022-04-27 15:25:24,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {9057#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {9057#true} assume !false; {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {9057#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {9057#true} assume 12292 == #t~mem49;havoc #t~mem49; {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {9057#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {9057#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {9057#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {9057#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {9057#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {9057#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {9057#true} assume !(0 == ~tmp___4~0); {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {9057#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {9057#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {9057#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {9057#true} ~skip~0 := 0; {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {9057#true} assume !false; {9057#true} is VALID [2022-04-27 15:25:24,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {9057#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {9057#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {9057#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {9057#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {9057#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {9057#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {9057#true} assume 4368 == #t~mem54;havoc #t~mem54; {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {9057#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9057#true} is VALID [2022-04-27 15:25:24,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {9057#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9057#true} is VALID [2022-04-27 15:25:24,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {9057#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-27 15:25:24,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {9062#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9063#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {9063#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {9058#false} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {9058#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {9058#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9058#false} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {9058#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {9058#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {9058#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9058#false} is VALID [2022-04-27 15:25:24,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {9058#false} assume !(0 == ~tmp___4~0); {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {9058#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {9058#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {9058#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {9058#false} ~skip~0 := 0; {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {9058#false} assume !false; {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {9058#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {9058#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {9058#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {9058#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {9058#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {9058#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {9058#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {9058#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {9058#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {9058#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {9058#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {9058#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {9058#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {9058#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9058#false} is VALID [2022-04-27 15:25:24,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {9058#false} assume 4432 == #t~mem62;havoc #t~mem62; {9058#false} is VALID [2022-04-27 15:25:24,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {9058#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9058#false} is VALID [2022-04-27 15:25:24,770 INFO L290 TraceCheckUtils]: 74: Hoare triple {9058#false} assume 4 == ~blastFlag~0; {9058#false} is VALID [2022-04-27 15:25:24,770 INFO L290 TraceCheckUtils]: 75: Hoare triple {9058#false} assume !false; {9058#false} is VALID [2022-04-27 15:25:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:25:24,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:24,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020732576] [2022-04-27 15:25:24,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020732576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:24,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:24,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463928043] [2022-04-27 15:25:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:24,772 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-27 15:25:24,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:24,773 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-27 15:25:24,841 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-27 15:25:24,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:24,843 INFO L87 Difference]: Start difference. First operand 264 states and 388 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-27 15:25:26,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:27,898 INFO L93 Difference]: Finished difference Result 671 states and 994 transitions. [2022-04-27 15:25:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:27,898 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-27 15:25:27,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:27,899 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-27 15:25:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-27 15:25:27,903 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-27 15:25:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-27 15:25:27,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-27 15:25:28,310 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-27 15:25:28,321 INFO L225 Difference]: With dead ends: 671 [2022-04-27 15:25:28,321 INFO L226 Difference]: Without dead ends: 423 [2022-04-27 15:25:28,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:28,322 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:28,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-27 15:25:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 270. [2022-04-27 15:25:28,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:28,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:28,331 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:28,332 INFO L87 Difference]: Start difference. First operand 423 states. Second operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:28,342 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-27 15:25:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-27 15:25:28,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:28,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:28,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:25:28,345 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 423 states. [2022-04-27 15:25:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:28,356 INFO L93 Difference]: Finished difference Result 423 states and 623 transitions. [2022-04-27 15:25:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 623 transitions. [2022-04-27 15:25:28,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:28,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:28,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:28,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 265 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 397 transitions. [2022-04-27 15:25:28,363 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 397 transitions. Word has length 76 [2022-04-27 15:25:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:28,363 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 397 transitions. [2022-04-27 15:25:28,363 INFO L496 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-27 15:25:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 397 transitions. [2022-04-27 15:25:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 15:25:28,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:28,364 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:28,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:25:28,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:28,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 1 times [2022-04-27 15:25:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:28,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555740513] [2022-04-27 15:25:28,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:28,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {11013#(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); {11007#true} is VALID [2022-04-27 15:25:28,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {11007#true} assume true; {11007#true} is VALID [2022-04-27 15:25:28,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11007#true} {11007#true} #593#return; {11007#true} is VALID [2022-04-27 15:25:28,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {11007#true} call ULTIMATE.init(); {11013#(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-27 15:25:28,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {11013#(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); {11007#true} is VALID [2022-04-27 15:25:28,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {11007#true} assume true; {11007#true} is VALID [2022-04-27 15:25:28,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11007#true} {11007#true} #593#return; {11007#true} is VALID [2022-04-27 15:25:28,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {11007#true} call #t~ret158 := main(); {11007#true} is VALID [2022-04-27 15:25:28,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {11007#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; {11007#true} is VALID [2022-04-27 15:25:28,542 INFO L272 TraceCheckUtils]: 6: Hoare triple {11007#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11007#true} is VALID [2022-04-27 15:25:28,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {11007#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {11007#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {11007#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {11007#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {11007#true} assume !false; {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {11007#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#true} assume 12292 == #t~mem49;havoc #t~mem49; {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {11007#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {11007#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {11007#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {11007#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {11007#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {11007#true} assume !(0 == ~tmp___4~0); {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {11007#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {11007#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {11007#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {11007#true} ~skip~0 := 0; {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {11007#true} assume !false; {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {11007#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {11007#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {11007#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {11007#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {11007#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {11007#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {11007#true} assume 4368 == #t~mem54;havoc #t~mem54; {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {11007#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11007#true} is VALID [2022-04-27 15:25:28,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {11007#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {11012#(= 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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,547 INFO L290 TraceCheckUtils]: 39: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !false; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11012#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {11012#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {11008#false} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {11008#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {11008#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {11008#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 55: Hoare triple {11008#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {11008#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {11008#false} ~skip~0 := 0; {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {11008#false} assume !false; {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {11008#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {11008#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {11008#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {11008#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {11008#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {11008#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {11008#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {11008#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {11008#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {11008#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {11008#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {11008#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {11008#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {11008#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {11008#false} assume 4432 == #t~mem62;havoc #t~mem62; {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {11008#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {11008#false} assume 4 == ~blastFlag~0; {11008#false} is VALID [2022-04-27 15:25:28,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {11008#false} assume !false; {11008#false} is VALID [2022-04-27 15:25:28,554 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-27 15:25:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:28,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555740513] [2022-04-27 15:25:28,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555740513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:28,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:28,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104390737] [2022-04-27 15:25:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:28,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:28,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:28,622 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-27 15:25:28,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:28,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:28,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:28,623 INFO L87 Difference]: Start difference. First operand 270 states and 397 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:30,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:31,282 INFO L93 Difference]: Finished difference Result 432 states and 637 transitions. [2022-04-27 15:25:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:31,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-27 15:25:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-27 15:25:31,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-27 15:25:31,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:31,595 INFO L225 Difference]: With dead ends: 432 [2022-04-27 15:25:31,595 INFO L226 Difference]: Without dead ends: 294 [2022-04-27 15:25:31,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:31,598 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:31,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:25:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-27 15:25:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-27 15:25:31,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:31,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:31,620 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:31,621 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:31,628 INFO L93 Difference]: Finished difference Result 294 states and 429 transitions. [2022-04-27 15:25:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 429 transitions. [2022-04-27 15:25:31,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:31,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:31,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-27 15:25:31,629 INFO L87 Difference]: Start difference. First operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 294 states. [2022-04-27 15:25:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:31,635 INFO L93 Difference]: Finished difference Result 294 states and 429 transitions. [2022-04-27 15:25:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 429 transitions. [2022-04-27 15:25:31,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:31,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:31,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:31,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 289 states have (on average 1.4705882352941178) internal successors, (425), 289 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 429 transitions. [2022-04-27 15:25:31,643 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 429 transitions. Word has length 77 [2022-04-27 15:25:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:31,644 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 429 transitions. [2022-04-27 15:25:31,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 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-27 15:25:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 429 transitions. [2022-04-27 15:25:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 15:25:31,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:31,645 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:31,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:25:31,646 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 1 times [2022-04-27 15:25:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:31,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114422316] [2022-04-27 15:25:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:31,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:31,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {12445#(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); {12439#true} is VALID [2022-04-27 15:25:31,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {12439#true} assume true; {12439#true} is VALID [2022-04-27 15:25:31,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12439#true} {12439#true} #593#return; {12439#true} is VALID [2022-04-27 15:25:31,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {12439#true} call ULTIMATE.init(); {12445#(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-27 15:25:31,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#(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); {12439#true} is VALID [2022-04-27 15:25:31,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {12439#true} assume true; {12439#true} is VALID [2022-04-27 15:25:31,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12439#true} {12439#true} #593#return; {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {12439#true} call #t~ret158 := main(); {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {12439#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; {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {12439#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {12439#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {12439#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {12439#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {12439#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {12439#true} assume !false; {12439#true} is VALID [2022-04-27 15:25:31,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {12439#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {12439#true} assume 12292 == #t~mem49;havoc #t~mem49; {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {12439#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {12439#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {12439#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {12439#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {12439#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {12439#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {12439#true} assume !(0 == ~tmp___4~0); {12439#true} is VALID [2022-04-27 15:25:31,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {12439#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {12439#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {12439#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {12439#true} ~skip~0 := 0; {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {12439#true} assume !false; {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {12439#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {12439#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {12439#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {12439#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {12439#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {12439#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {12439#true} assume 4368 == #t~mem54;havoc #t~mem54; {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {12439#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {12439#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {12439#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {12439#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {12439#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {12439#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {12439#true} ~skip~0 := 0; {12439#true} is VALID [2022-04-27 15:25:31,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {12439#true} assume !false; {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {12439#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {12439#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {12439#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {12439#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {12439#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {12439#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {12439#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {12439#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12439#true} is VALID [2022-04-27 15:25:31,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {12439#true} assume 4384 == #t~mem56;havoc #t~mem56; {12439#true} is VALID [2022-04-27 15:25:31,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {12439#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12439#true} is VALID [2022-04-27 15:25:31,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {12439#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,836 INFO L290 TraceCheckUtils]: 56: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,837 INFO L290 TraceCheckUtils]: 59: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,837 INFO L290 TraceCheckUtils]: 60: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {12444#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:31,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {12444#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {12440#false} is VALID [2022-04-27 15:25:31,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {12440#false} assume !false; {12440#false} is VALID [2022-04-27 15:25:31,842 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-27 15:25:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114422316] [2022-04-27 15:25:31,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114422316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:31,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:31,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175162269] [2022-04-27 15:25:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:31,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 15:25:31,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:31,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:31,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:31,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:31,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:31,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:31,901 INFO L87 Difference]: Start difference. First operand 294 states and 429 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:33,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:34,889 INFO L93 Difference]: Finished difference Result 590 states and 869 transitions. [2022-04-27 15:25:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:34,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 15:25:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-27 15:25:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-27 15:25:34,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-27 15:25:35,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:35,315 INFO L225 Difference]: With dead ends: 590 [2022-04-27 15:25:35,315 INFO L226 Difference]: Without dead ends: 428 [2022-04-27 15:25:35,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:35,316 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:35,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-27 15:25:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2022-04-27 15:25:35,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:35,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,327 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,328 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:35,340 INFO L93 Difference]: Finished difference Result 428 states and 626 transitions. [2022-04-27 15:25:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 626 transitions. [2022-04-27 15:25:35,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:35,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:35,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-27 15:25:35,343 INFO L87 Difference]: Start difference. First operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 428 states. [2022-04-27 15:25:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:35,354 INFO L93 Difference]: Finished difference Result 428 states and 626 transitions. [2022-04-27 15:25:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 626 transitions. [2022-04-27 15:25:35,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:35,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:35,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:35,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.470449172576832) internal successors, (622), 423 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 626 transitions. [2022-04-27 15:25:35,367 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 626 transitions. Word has length 77 [2022-04-27 15:25:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:35,367 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 626 transitions. [2022-04-27 15:25:35,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 626 transitions. [2022-04-27 15:25:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 15:25:35,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:35,369 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:35,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:25:35,369 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:35,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 1 times [2022-04-27 15:25:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:35,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144119983] [2022-04-27 15:25:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:35,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {14476#(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); {14470#true} is VALID [2022-04-27 15:25:35,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {14470#true} assume true; {14470#true} is VALID [2022-04-27 15:25:35,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14470#true} {14470#true} #593#return; {14470#true} is VALID [2022-04-27 15:25:35,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {14470#true} call ULTIMATE.init(); {14476#(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-27 15:25:35,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {14476#(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); {14470#true} is VALID [2022-04-27 15:25:35,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {14470#true} assume true; {14470#true} is VALID [2022-04-27 15:25:35,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14470#true} {14470#true} #593#return; {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {14470#true} call #t~ret158 := main(); {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {14470#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; {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {14470#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {14470#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {14470#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {14470#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {14470#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14470#true} is VALID [2022-04-27 15:25:35,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {14470#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {14470#true} assume 12292 == #t~mem49;havoc #t~mem49; {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {14470#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {14470#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {14470#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {14470#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {14470#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {14470#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {14470#true} assume !(0 == ~tmp___4~0); {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {14470#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {14470#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {14470#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {14470#true} ~skip~0 := 0; {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {14470#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {14470#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {14470#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {14470#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {14470#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {14470#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {14470#true} assume 4368 == #t~mem54;havoc #t~mem54; {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {14470#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {14470#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14470#true} is VALID [2022-04-27 15:25:35,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {14470#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {14470#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {14470#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {14470#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {14470#true} ~skip~0 := 0; {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {14470#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {14470#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {14470#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {14470#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {14470#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {14470#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {14470#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {14470#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {14470#true} assume 4384 == #t~mem56;havoc #t~mem56; {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {14470#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {14470#true} is VALID [2022-04-27 15:25:35,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {14470#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {14470#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {14470#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {14470#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {14470#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {14470#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {14470#true} ~skip~0 := 0; {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {14470#true} assume !false; {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {14470#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {14470#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {14470#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {14470#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {14470#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {14470#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {14470#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {14470#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {14470#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {14470#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {14470#true} assume 4400 == #t~mem58;havoc #t~mem58; {14470#true} is VALID [2022-04-27 15:25:35,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {14470#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {14470#true} is VALID [2022-04-27 15:25:35,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {14470#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {14470#true} is VALID [2022-04-27 15:25:35,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {14470#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {14475#(= 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); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,555 INFO L290 TraceCheckUtils]: 78: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,555 INFO L290 TraceCheckUtils]: 79: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,555 INFO L290 TraceCheckUtils]: 80: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,556 INFO L290 TraceCheckUtils]: 81: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,556 INFO L290 TraceCheckUtils]: 82: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,556 INFO L290 TraceCheckUtils]: 83: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,557 INFO L290 TraceCheckUtils]: 84: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,557 INFO L290 TraceCheckUtils]: 85: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,558 INFO L290 TraceCheckUtils]: 87: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,558 INFO L290 TraceCheckUtils]: 88: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,558 INFO L290 TraceCheckUtils]: 89: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,559 INFO L290 TraceCheckUtils]: 90: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,559 INFO L290 TraceCheckUtils]: 91: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,559 INFO L290 TraceCheckUtils]: 92: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,560 INFO L290 TraceCheckUtils]: 93: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,560 INFO L290 TraceCheckUtils]: 94: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {14475#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-27 15:25:35,560 INFO L290 TraceCheckUtils]: 95: Hoare triple {14475#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {14471#false} is VALID [2022-04-27 15:25:35,560 INFO L290 TraceCheckUtils]: 96: Hoare triple {14471#false} assume !false; {14471#false} is VALID [2022-04-27 15:25:35,561 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-27 15:25:35,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:35,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144119983] [2022-04-27 15:25:35,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144119983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:35,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:35,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:25:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101580774] [2022-04-27 15:25:35,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:35,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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 97 [2022-04-27 15:25:35,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:35,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-27 15:25:35,623 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-27 15:25:35,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:25:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:35,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:25:35,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:35,624 INFO L87 Difference]: Start difference. First operand 428 states and 626 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-27 15:25:37,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:38,600 INFO L93 Difference]: Finished difference Result 858 states and 1264 transitions. [2022-04-27 15:25:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:25:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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 97 [2022-04-27 15:25:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-27 15:25:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-27 15:25:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-27 15:25:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-27 15:25:38,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-27 15:25:39,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:39,025 INFO L225 Difference]: With dead ends: 858 [2022-04-27 15:25:39,025 INFO L226 Difference]: Without dead ends: 562 [2022-04-27 15:25:39,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:25:39,027 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:39,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:25:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-04-27 15:25:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-04-27 15:25:39,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:39,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 562 states. Second operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,041 INFO L74 IsIncluded]: Start isIncluded. First operand 562 states. Second operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,042 INFO L87 Difference]: Start difference. First operand 562 states. Second operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,064 INFO L93 Difference]: Finished difference Result 562 states and 823 transitions. [2022-04-27 15:25:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 823 transitions. [2022-04-27 15:25:39,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:39,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:39,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 562 states. [2022-04-27 15:25:39,067 INFO L87 Difference]: Start difference. First operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 562 states. [2022-04-27 15:25:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:39,083 INFO L93 Difference]: Finished difference Result 562 states and 823 transitions. [2022-04-27 15:25:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 823 transitions. [2022-04-27 15:25:39,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:39,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:39,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:39,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 557 states have (on average 1.4703770197486534) internal successors, (819), 557 states have internal predecessors, (819), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 823 transitions. [2022-04-27 15:25:39,103 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 823 transitions. Word has length 97 [2022-04-27 15:25:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:39,103 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 823 transitions. [2022-04-27 15:25:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-27 15:25:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 823 transitions. [2022-04-27 15:25:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-27 15:25:39,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:39,113 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:39,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:25:39,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-27 15:25:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:39,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653523182] [2022-04-27 15:25:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:39,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {17232#(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); {17225#true} is VALID [2022-04-27 15:25:39,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {17225#true} assume true; {17225#true} is VALID [2022-04-27 15:25:39,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17225#true} {17225#true} #593#return; {17225#true} is VALID [2022-04-27 15:25:39,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {17225#true} call ULTIMATE.init(); {17232#(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-27 15:25:39,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {17232#(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); {17225#true} is VALID [2022-04-27 15:25:39,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {17225#true} assume true; {17225#true} is VALID [2022-04-27 15:25:39,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17225#true} {17225#true} #593#return; {17225#true} is VALID [2022-04-27 15:25:39,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {17225#true} call #t~ret158 := main(); {17225#true} is VALID [2022-04-27 15:25:39,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {17225#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; {17225#true} is VALID [2022-04-27 15:25:39,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {17225#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {17225#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {17225#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {17225#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {17225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {17225#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {17225#true} assume 12292 == #t~mem49;havoc #t~mem49; {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {17225#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {17225#true} is VALID [2022-04-27 15:25:39,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {17225#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {17225#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {17225#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {17225#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {17225#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {17225#true} assume !(0 == ~tmp___4~0); {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {17225#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {17225#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {17225#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17225#true} is VALID [2022-04-27 15:25:39,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {17225#true} ~skip~0 := 0; {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {17225#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {17225#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {17225#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {17225#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {17225#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {17225#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {17225#true} assume 4368 == #t~mem54;havoc #t~mem54; {17225#true} is VALID [2022-04-27 15:25:39,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {17225#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {17225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {17225#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {17225#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {17225#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {17225#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {17225#true} ~skip~0 := 0; {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {17225#true} assume !false; {17225#true} is VALID [2022-04-27 15:25:39,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {17225#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {17225#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {17225#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {17225#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {17225#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {17225#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {17225#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {17225#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {17225#true} assume 4384 == #t~mem56;havoc #t~mem56; {17225#true} is VALID [2022-04-27 15:25:39,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {17225#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17225#true} is VALID [2022-04-27 15:25:39,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {17225#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17225#true} is VALID [2022-04-27 15:25:39,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {17225#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17225#true} is VALID [2022-04-27 15:25:39,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {17225#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,345 INFO L290 TraceCheckUtils]: 65: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,345 INFO L290 TraceCheckUtils]: 66: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,345 INFO L290 TraceCheckUtils]: 67: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-27 15:25:39,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {17230#(= 4560 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17231#(= |ssl3_connect_#t~mem58| 4560)} is VALID [2022-04-27 15:25:39,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {17231#(= |ssl3_connect_#t~mem58| 4560)} assume 4400 == #t~mem58;havoc #t~mem58; {17226#false} is VALID [2022-04-27 15:25:39,346 INFO L290 TraceCheckUtils]: 70: Hoare triple {17226#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,346 INFO L290 TraceCheckUtils]: 71: Hoare triple {17226#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {17226#false} is VALID [2022-04-27 15:25:39,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {17226#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {17226#false} assume !(~ret~0 <= 0); {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {17226#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {17226#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {17226#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {17226#false} ~skip~0 := 0; {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {17226#false} assume !false; {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {17226#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,347 INFO L290 TraceCheckUtils]: 80: Hoare triple {17226#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 81: Hoare triple {17226#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 82: Hoare triple {17226#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 83: Hoare triple {17226#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {17226#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {17226#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {17226#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 87: Hoare triple {17226#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {17226#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {17226#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {17226#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 91: Hoare triple {17226#false} assume 4416 == #t~mem60;havoc #t~mem60; {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {17226#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {17226#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 94: Hoare triple {17226#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); {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 95: Hoare triple {17226#false} assume !(0 == ~tmp___6~0); {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 96: Hoare triple {17226#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 97: Hoare triple {17226#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17226#false} is VALID [2022-04-27 15:25:39,349 INFO L290 TraceCheckUtils]: 98: Hoare triple {17226#false} ~skip~0 := 0; {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 99: Hoare triple {17226#false} assume !false; {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 100: Hoare triple {17226#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 101: Hoare triple {17226#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 102: Hoare triple {17226#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 103: Hoare triple {17226#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 104: Hoare triple {17226#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 105: Hoare triple {17226#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 106: Hoare triple {17226#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,350 INFO L290 TraceCheckUtils]: 107: Hoare triple {17226#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 108: Hoare triple {17226#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 109: Hoare triple {17226#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 110: Hoare triple {17226#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 111: Hoare triple {17226#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 112: Hoare triple {17226#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 113: Hoare triple {17226#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 114: Hoare triple {17226#false} assume 4432 == #t~mem62;havoc #t~mem62; {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 115: Hoare triple {17226#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17226#false} is VALID [2022-04-27 15:25:39,351 INFO L290 TraceCheckUtils]: 116: Hoare triple {17226#false} assume 4 == ~blastFlag~0; {17226#false} is VALID [2022-04-27 15:25:39,352 INFO L290 TraceCheckUtils]: 117: Hoare triple {17226#false} assume !false; {17226#false} is VALID [2022-04-27 15:25:39,352 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-27 15:25:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:39,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653523182] [2022-04-27 15:25:39,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653523182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:39,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:39,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151552831] [2022-04-27 15:25:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:39,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-27 15:25:39,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:39,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:39,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:25:39,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:39,434 INFO L87 Difference]: Start difference. First operand 562 states and 823 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:41,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:25:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:42,916 INFO L93 Difference]: Finished difference Result 1475 states and 2166 transitions. [2022-04-27 15:25:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:42,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-27 15:25:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-27 15:25:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-27 15:25:42,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-27 15:25:43,322 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-27 15:25:43,368 INFO L225 Difference]: With dead ends: 1475 [2022-04-27 15:25:43,368 INFO L226 Difference]: Without dead ends: 929 [2022-04-27 15:25:43,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:43,369 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 99 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:43,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 576 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 550 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-04-27 15:25:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 646. [2022-04-27 15:25:43,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:43,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 929 states. Second operand has 646 states, 641 states have (on average 1.4836193447737909) internal successors, (951), 641 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,388 INFO L74 IsIncluded]: Start isIncluded. First operand 929 states. Second operand has 646 states, 641 states have (on average 1.4836193447737909) internal successors, (951), 641 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,389 INFO L87 Difference]: Start difference. First operand 929 states. Second operand has 646 states, 641 states have (on average 1.4836193447737909) internal successors, (951), 641 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,426 INFO L93 Difference]: Finished difference Result 929 states and 1359 transitions. [2022-04-27 15:25:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1359 transitions. [2022-04-27 15:25:43,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:43,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:43,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 646 states, 641 states have (on average 1.4836193447737909) internal successors, (951), 641 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 929 states. [2022-04-27 15:25:43,431 INFO L87 Difference]: Start difference. First operand has 646 states, 641 states have (on average 1.4836193447737909) internal successors, (951), 641 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 929 states. [2022-04-27 15:25:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:43,468 INFO L93 Difference]: Finished difference Result 929 states and 1359 transitions. [2022-04-27 15:25:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1359 transitions. [2022-04-27 15:25:43,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:43,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:43,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:43,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 641 states have (on average 1.4836193447737909) internal successors, (951), 641 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 955 transitions. [2022-04-27 15:25:43,492 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 955 transitions. Word has length 118 [2022-04-27 15:25:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:43,493 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 955 transitions. [2022-04-27 15:25:43,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 955 transitions. [2022-04-27 15:25:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-27 15:25:43,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:43,496 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:25:43,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:25:43,496 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -577524775, now seen corresponding path program 1 times [2022-04-27 15:25:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:43,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243355815] [2022-04-27 15:25:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:25:44,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:25:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:25:45,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:25:45,278 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:25:45,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:25:45,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:25:45,283 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:45,286 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:25:45,408 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:25:45,408 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:25:45,408 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-27 15:25:45,408 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:25:45,408 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:25:45,408 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-27 15:25:45,409 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-27 15:25:45,410 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-27 15:25:45,411 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-27 15:25:45,412 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-27 15:25:45,413 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-27 15:25:45,414 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-27 15:25:45,415 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1337-2 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1337-2 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1347 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:25:45,416 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1347-2 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-27 15:25:45,417 WARN L170 areAnnotationChecker]: L1363-2 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1363-2 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1363 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1363 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-27 15:25:45,418 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:25:45,419 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:25:45,420 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:25:45,421 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:25:45,422 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:25:45,423 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-27 15:25:45,424 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-27 15:25:45,425 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-27 15:25:45,426 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-27 15:25:45,427 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-27 15:25:45,427 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-27 15:25:45,427 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:25:45,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:25:45 BoogieIcfgContainer [2022-04-27 15:25:45,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:25:45,429 INFO L158 Benchmark]: Toolchain (without parser) took 50519.61ms. Allocated memory was 169.9MB in the beginning and 223.3MB in the end (delta: 53.5MB). Free memory was 118.7MB in the beginning and 49.8MB in the end (delta: 68.9MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. [2022-04-27 15:25:45,429 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 169.9MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:25:45,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.72ms. Allocated memory is still 169.9MB. Free memory was 118.5MB in the beginning and 125.3MB in the end (delta: -6.8MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-04-27 15:25:45,430 INFO L158 Benchmark]: Boogie Preprocessor took 131.11ms. Allocated memory is still 169.9MB. Free memory was 125.3MB in the beginning and 115.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 15:25:45,431 INFO L158 Benchmark]: RCFGBuilder took 2042.99ms. Allocated memory is still 169.9MB. Free memory was 115.9MB in the beginning and 64.9MB in the end (delta: 51.0MB). Peak memory consumption was 51.9MB. Max. memory is 8.0GB. [2022-04-27 15:25:45,431 INFO L158 Benchmark]: TraceAbstraction took 47755.65ms. Allocated memory was 169.9MB in the beginning and 223.3MB in the end (delta: 53.5MB). Free memory was 64.4MB in the beginning and 49.8MB in the end (delta: 14.6MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2022-04-27 15:25:45,432 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.31ms. Allocated memory is still 169.9MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 583.72ms. Allocated memory is still 169.9MB. Free memory was 118.5MB in the beginning and 125.3MB in the end (delta: -6.8MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 131.11ms. Allocated memory is still 169.9MB. Free memory was 125.3MB in the beginning and 115.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2042.99ms. Allocated memory is still 169.9MB. Free memory was 115.9MB in the beginning and 64.9MB in the end (delta: 51.0MB). Peak memory consumption was 51.9MB. Max. memory is 8.0GB. * TraceAbstraction took 47755.65ms. Allocated memory was 169.9MB in the beginning and 223.3MB in the end (delta: 53.5MB). Free memory was 64.4MB in the beginning and 49.8MB in the end (delta: 14.6MB). Peak memory consumption was 75.9MB. 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: 1665]: 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 1356. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967300, \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 ; [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 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->info_callback={0:-6}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] EXPR s->version VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->version=-5, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->bbio={0:-11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1347] COND FALSE !(s->hit) [L1350] s->state = 4400 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1352] s->init_num = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1356] EXPR s->s3 [L1356] EXPR (s->s3)->tmp.new_cipher [L1356] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967346, (s->s3)->tmp.new_cipher={-8:0}, blastFlag=2, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1356] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 2 [L1361] blastFlag = 3 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967343, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1665] reach_error() VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.6s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 28.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 862 mSDsluCounter, 5244 SdHoareTripleChecker+Invalid, 28.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2815 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4122 IncrementalHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 2429 mSDtfsCounter, 4122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=12, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 661 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 861 ConstructedInterpolants, 0 QuantifiedInterpolants, 1966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 555/555 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 15:25:45,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...