/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:12:49,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:12:49,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:12:49,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:12:49,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:12:49,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:12:49,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:12:49,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:12:49,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:12:49,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:12:49,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:12:49,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:12:49,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:12:49,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:12:49,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:12:49,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:12:49,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:12:49,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:12:49,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:12:49,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:12:49,190 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:12:49,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:12:49,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:12:49,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:12:49,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:12:49,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:12:49,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:12:49,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:12:49,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:12:49,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:12:49,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:12:49,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:12:49,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:12:49,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:12:49,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:12:49,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:12:49,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:12:49,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:12:49,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:12:49,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:12:49,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:12:49,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:12:49,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:12:49,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:12:49,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:12:49,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:12:49,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:12:49,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:12:49,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:12:49,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:12:49,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:12:49,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:12:49,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:12:49,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:12:49,222 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:12:49,223 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:12:49,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:12:49,223 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:12:49,223 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 15:12:49,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:12:49,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:12:49,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:12:49,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:12:49,432 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:12:49,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-28 15:12:49,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fbbeb92/b04a728b2e4649c6a0b75df78ed6ed26/FLAG2d9c51763 [2022-04-28 15:12:49,902 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:12:49,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-28 15:12:49,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fbbeb92/b04a728b2e4649c6a0b75df78ed6ed26/FLAG2d9c51763 [2022-04-28 15:12:50,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fbbeb92/b04a728b2e4649c6a0b75df78ed6ed26 [2022-04-28 15:12:50,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:12:50,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:12:50,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:12:50,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:12:50,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:12:50,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b02850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50, skipping insertion in model container [2022-04-28 15:12:50,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:12:50,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:12:50,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c[65523,65536] [2022-04-28 15:12:50,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:12:50,579 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:12:50,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c[65523,65536] [2022-04-28 15:12:50,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:12:50,680 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:12:50,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50 WrapperNode [2022-04-28 15:12:50,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:12:50,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:12:50,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:12:50,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:12:50,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:12:50,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:12:50,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:12:50,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:12:50,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (1/1) ... [2022-04-28 15:12:50,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:12:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:12:50,798 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-28 15:12:50,817 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-28 15:12:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:12:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:12:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:12:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 15:12:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 15:12:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:12:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 15:12:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:12:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:12:50,830 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:12:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:12:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:12:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:12:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:12:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:12:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:12:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:12:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:12:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:12:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:12:50,988 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:12:50,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:12:52,377 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:12:52,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 15:12:52,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 15:12:52,816 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:12:52,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:12:52,822 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:12:52,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:52 BoogieIcfgContainer [2022-04-28 15:12:52,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:12:52,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:12:52,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:12:52,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:12:52,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:12:50" (1/3) ... [2022-04-28 15:12:52,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@838536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:52, skipping insertion in model container [2022-04-28 15:12:52,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:50" (2/3) ... [2022-04-28 15:12:52,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@838536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:52, skipping insertion in model container [2022-04-28 15:12:52,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:52" (3/3) ... [2022-04-28 15:12:52,837 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2022-04-28 15:12:52,848 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:12:52,848 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:12:52,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:12:52,891 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47ef3edb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a34fc15 [2022-04-28 15:12:52,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:12:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 15:12:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:12:52,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:12:52,910 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-28 15:12:52,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:12:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:12:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 1 times [2022-04-28 15:12:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:12:52,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1838772945] [2022-04-28 15:12:52,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:12:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 2 times [2022-04-28 15:12:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:12:52,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965748357] [2022-04-28 15:12:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:12:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:12:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:12:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:53,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-28 15:12:53,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 15:12:53,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-28 15:12:53,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:12:53,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-28 15:12:53,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-28 15:12:53,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-28 15:12:53,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-28 15:12:53,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {143#true} is VALID [2022-04-28 15:12:53,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-28 15:12:53,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:12:53,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {149#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-28 15:12:53,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {149#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-28 15:12:53,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-28 15:12:53,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-28 15:12:53,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-28 15:12:53,502 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-28 15:12:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:12:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965748357] [2022-04-28 15:12:53,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965748357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:12:53,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:12:53,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:12:53,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:12:53,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1838772945] [2022-04-28 15:12:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1838772945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:12:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:12:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:12:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871482438] [2022-04-28 15:12:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:12:53,515 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-28 15:12:53,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:12:53,520 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-28 15:12:53,563 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-28 15:12:53,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:12:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:12:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:12:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:12:53,585 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:12:55,634 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-28 15:12:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:12:57,098 INFO L93 Difference]: Finished difference Result 375 states and 621 transitions. [2022-04-28 15:12:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:12:57,099 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-28 15:12:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:12:57,100 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-28 15:12:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-28 15:12:57,112 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-28 15:12:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-28 15:12:57,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 621 transitions. [2022-04-28 15:12:57,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:12:57,588 INFO L225 Difference]: With dead ends: 375 [2022-04-28 15:12:57,588 INFO L226 Difference]: Without dead ends: 214 [2022-04-28 15:12:57,590 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-28 15:12:57,592 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 141 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:12:57,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 405 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:12:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-28 15:12:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 144. [2022-04-28 15:12:57,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:12:57,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:12:57,621 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:12:57,621 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:12:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:12:57,628 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-04-28 15:12:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 319 transitions. [2022-04-28 15:12:57,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:12:57,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:12:57,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-28 15:12:57,630 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-28 15:12:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:12:57,637 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-04-28 15:12:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 319 transitions. [2022-04-28 15:12:57,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:12:57,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:12:57,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:12:57,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:12:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.5467625899280575) internal successors, (215), 139 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:12:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2022-04-28 15:12:57,671 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 30 [2022-04-28 15:12:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:12:57,672 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2022-04-28 15:12:57,672 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-28 15:12:57,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 219 transitions. [2022-04-28 15:12:57,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:12:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2022-04-28 15:12:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:12:57,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:12:57,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:12:57,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:12:57,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:12:57,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:12:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash 312847758, now seen corresponding path program 1 times [2022-04-28 15:12:57,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:12:57,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661808544] [2022-04-28 15:12:57,830 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:12:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash 312847758, now seen corresponding path program 2 times [2022-04-28 15:12:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:12:57,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228290716] [2022-04-28 15:12:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:12:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:12:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:12:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:12:58,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {1628#(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(196, 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); {1621#true} is VALID [2022-04-28 15:12:58,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#true} assume true; {1621#true} is VALID [2022-04-28 15:12:58,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1621#true} {1621#true} #592#return; {1621#true} is VALID [2022-04-28 15:12:58,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {1621#true} call ULTIMATE.init(); {1628#(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-28 15:12:58,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {1628#(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(196, 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); {1621#true} is VALID [2022-04-28 15:12:58,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {1621#true} assume true; {1621#true} is VALID [2022-04-28 15:12:58,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1621#true} {1621#true} #592#return; {1621#true} is VALID [2022-04-28 15:12:58,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {1621#true} call #t~ret159 := main(); {1621#true} is VALID [2022-04-28 15:12:58,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {1621#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1621#true} is VALID [2022-04-28 15:12:58,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {1621#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1621#true} is VALID [2022-04-28 15:12:58,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:12:58,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:12:58,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:12:58,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 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)))); {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:12:58,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:12:58,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1627#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-28 15:12:58,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {1627#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {1622#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1622#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {1622#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {1622#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1622#false} is VALID [2022-04-28 15:12:58,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#false} assume 4433 == #t~mem57;havoc #t~mem57; {1622#false} is VALID [2022-04-28 15:12:58,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {1622#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1622#false} is VALID [2022-04-28 15:12:58,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#false} assume 5 == ~blastFlag~0; {1622#false} is VALID [2022-04-28 15:12:58,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#false} assume !false; {1622#false} is VALID [2022-04-28 15:12:58,020 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-28 15:12:58,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:12:58,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228290716] [2022-04-28 15:12:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228290716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:12:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:12:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:12:58,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:12:58,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661808544] [2022-04-28 15:12:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661808544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:12:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:12:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:12:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719937709] [2022-04-28 15:12:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:12:58,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 15:12:58,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:12:58,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:12:58,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:12:58,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:12:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:12:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:12:58,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:12:58,048 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:00,068 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-28 15:13:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:00,806 INFO L93 Difference]: Finished difference Result 279 states and 426 transitions. [2022-04-28 15:13:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:13:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 15:13:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-04-28 15:13:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2022-04-28 15:13:00,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 342 transitions. [2022-04-28 15:13:01,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:01,062 INFO L225 Difference]: With dead ends: 279 [2022-04-28 15:13:01,062 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 15:13:01,063 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-28 15:13:01,063 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:01,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 423 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:13:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 15:13:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2022-04-28 15:13:01,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:01,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:01,073 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:01,073 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:01,078 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-04-28 15:13:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-28 15:13:01,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:01,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:01,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states. [2022-04-28 15:13:01,080 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 148 states. [2022-04-28 15:13:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:01,085 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-04-28 15:13:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-28 15:13:01,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:01,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:01,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:01,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2022-04-28 15:13:01,091 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 31 [2022-04-28 15:13:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:01,091 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2022-04-28 15:13:01,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:01,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 222 transitions. [2022-04-28 15:13:01,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2022-04-28 15:13:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 15:13:01,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:01,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:13:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:13:01,263 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash 403410774, now seen corresponding path program 1 times [2022-04-28 15:13:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:01,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237626552] [2022-04-28 15:13:01,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:13:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash 403410774, now seen corresponding path program 2 times [2022-04-28 15:13:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:13:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012590985] [2022-04-28 15:13:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:13:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:13:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:13:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:01,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {2787#(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(196, 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); {2781#true} is VALID [2022-04-28 15:13:01,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-28 15:13:01,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2781#true} {2781#true} #592#return; {2781#true} is VALID [2022-04-28 15:13:01,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2787#(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-28 15:13:01,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {2787#(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(196, 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); {2781#true} is VALID [2022-04-28 15:13:01,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-28 15:13:01,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #592#return; {2781#true} is VALID [2022-04-28 15:13:01,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret159 := main(); {2781#true} is VALID [2022-04-28 15:13:01,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2781#true} is VALID [2022-04-28 15:13:01,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {2781#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2781#true} is VALID [2022-04-28 15:13:01,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(= 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)))); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !false; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !false; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 4433 == #t~mem57;havoc #t~mem57; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2786#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:13:01,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {2786#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {2782#false} is VALID [2022-04-28 15:13:01,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-28 15:13:01,493 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-28 15:13:01,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:13:01,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012590985] [2022-04-28 15:13:01,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012590985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:01,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:01,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:13:01,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:13:01,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1237626552] [2022-04-28 15:13:01,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1237626552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:01,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:01,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:13:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013569950] [2022-04-28 15:13:01,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:13:01,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 15:13:01,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:13:01,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:01,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:01,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:13:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:01,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:13:01,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:13:01,536 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:03,553 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-28 15:13:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:04,106 INFO L93 Difference]: Finished difference Result 405 states and 622 transitions. [2022-04-28 15:13:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:13:04,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 15:13:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-28 15:13:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-28 15:13:04,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-28 15:13:04,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:04,475 INFO L225 Difference]: With dead ends: 405 [2022-04-28 15:13:04,475 INFO L226 Difference]: Without dead ends: 274 [2022-04-28 15:13:04,476 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-28 15:13:04,476 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 124 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:04,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:13:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-28 15:13:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-04-28 15:13:04,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:04,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,491 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,491 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:04,497 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-04-28 15:13:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-28 15:13:04,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:04,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:04,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 274 states. [2022-04-28 15:13:04,498 INFO L87 Difference]: Start difference. First operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 274 states. [2022-04-28 15:13:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:04,504 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-04-28 15:13:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-28 15:13:04,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:04,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:04,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:04,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 414 transitions. [2022-04-28 15:13:04,512 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 414 transitions. Word has length 46 [2022-04-28 15:13:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:04,512 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 414 transitions. [2022-04-28 15:13:04,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:04,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 274 states and 414 transitions. [2022-04-28 15:13:04,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-04-28 15:13:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 15:13:04,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:04,788 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, 1, 1] [2022-04-28 15:13:04,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:13:04,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash 742139183, now seen corresponding path program 1 times [2022-04-28 15:13:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [116731537] [2022-04-28 15:13:04,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:13:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash 742139183, now seen corresponding path program 2 times [2022-04-28 15:13:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:13:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070440310] [2022-04-28 15:13:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:13:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:13:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:13:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:04,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {4703#(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(196, 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); {4696#true} is VALID [2022-04-28 15:13:04,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {4696#true} assume true; {4696#true} is VALID [2022-04-28 15:13:04,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4696#true} {4696#true} #592#return; {4696#true} is VALID [2022-04-28 15:13:04,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {4696#true} call ULTIMATE.init(); {4703#(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-28 15:13:04,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {4703#(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(196, 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); {4696#true} is VALID [2022-04-28 15:13:04,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {4696#true} assume true; {4696#true} is VALID [2022-04-28 15:13:04,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4696#true} {4696#true} #592#return; {4696#true} is VALID [2022-04-28 15:13:04,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {4696#true} call #t~ret159 := main(); {4696#true} is VALID [2022-04-28 15:13:04,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {4696#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {4696#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {4696#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {4696#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {4696#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {4696#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#true} assume !false; {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#true} assume 12292 == #t~mem43;havoc #t~mem43; {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {4696#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {4696#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {4696#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {4696#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {4696#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {4696#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {4696#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {4696#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {4696#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {4696#true} ~skip~0 := 0; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {4696#true} assume !false; {4696#true} is VALID [2022-04-28 15:13:04,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {4696#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {4696#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {4696#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {4696#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {4696#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {4696#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {4696#true} assume 4368 == #t~mem48;havoc #t~mem48; {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {4696#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {4696#true} is VALID [2022-04-28 15:13:04,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {4696#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4696#true} is VALID [2022-04-28 15:13:04,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {4696#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:13:04,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {4701#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {4702#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-28 15:13:04,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {4702#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {4697#false} is VALID [2022-04-28 15:13:04,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {4697#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4697#false} is VALID [2022-04-28 15:13:04,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {4697#false} assume 5 == ~blastFlag~0; {4697#false} is VALID [2022-04-28 15:13:04,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {4697#false} assume !false; {4697#false} is VALID [2022-04-28 15:13:04,986 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-28 15:13:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:13:04,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070440310] [2022-04-28 15:13:04,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070440310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:04,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:04,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:04,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:13:04,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [116731537] [2022-04-28 15:13:04,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [116731537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:04,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:04,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:04,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192007733] [2022-04-28 15:13:04,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:13:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 15:13:04,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:13:04,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:05,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:05,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:13:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:13:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:13:05,031 INFO L87 Difference]: Start difference. First operand 274 states and 414 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:07,052 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-28 15:13:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:08,017 INFO L93 Difference]: Finished difference Result 717 states and 1086 transitions. [2022-04-28 15:13:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:13:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 15:13:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 15:13:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 15:13:08,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 15:13:08,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:08,363 INFO L225 Difference]: With dead ends: 717 [2022-04-28 15:13:08,363 INFO L226 Difference]: Without dead ends: 459 [2022-04-28 15:13:08,364 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-28 15:13:08,366 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:08,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:13:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-28 15:13:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 324. [2022-04-28 15:13:08,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:08,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,397 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,398 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:08,408 INFO L93 Difference]: Finished difference Result 459 states and 690 transitions. [2022-04-28 15:13:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 690 transitions. [2022-04-28 15:13:08,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:08,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:08,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-28 15:13:08,410 INFO L87 Difference]: Start difference. First operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 459 states. [2022-04-28 15:13:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:08,420 INFO L93 Difference]: Finished difference Result 459 states and 690 transitions. [2022-04-28 15:13:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 690 transitions. [2022-04-28 15:13:08,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:08,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:08,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:08,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 319 states have (on average 1.561128526645768) internal successors, (498), 319 states have internal predecessors, (498), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 502 transitions. [2022-04-28 15:13:08,428 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 502 transitions. Word has length 61 [2022-04-28 15:13:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:08,428 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 502 transitions. [2022-04-28 15:13:08,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:08,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 502 transitions. [2022-04-28 15:13:08,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 502 transitions. [2022-04-28 15:13:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 15:13:08,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:08,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:13:08,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:13:08,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1516939404, now seen corresponding path program 1 times [2022-04-28 15:13:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:08,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1027828549] [2022-04-28 15:13:08,775 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:13:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1516939404, now seen corresponding path program 2 times [2022-04-28 15:13:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:13:08,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712119710] [2022-04-28 15:13:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:13:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:13:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:13:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:08,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {7715#(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(196, 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); {7708#true} is VALID [2022-04-28 15:13:08,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {7708#true} assume true; {7708#true} is VALID [2022-04-28 15:13:08,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7708#true} {7708#true} #592#return; {7708#true} is VALID [2022-04-28 15:13:08,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {7708#true} call ULTIMATE.init(); {7715#(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-28 15:13:08,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {7715#(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(196, 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); {7708#true} is VALID [2022-04-28 15:13:08,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {7708#true} assume true; {7708#true} is VALID [2022-04-28 15:13:08,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7708#true} {7708#true} #592#return; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {7708#true} call #t~ret159 := main(); {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {7708#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {7708#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {7708#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {7708#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {7708#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {7708#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {7708#true} assume !false; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {7708#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {7708#true} assume 12292 == #t~mem43;havoc #t~mem43; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {7708#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {7708#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {7708#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7708#true} is VALID [2022-04-28 15:13:08,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {7708#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {7708#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {7708#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {7708#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {7708#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {7708#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {7708#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {7708#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {7708#true} ~skip~0 := 0; {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {7708#true} assume !false; {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {7708#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {7708#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {7708#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {7708#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {7708#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {7708#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {7708#true} assume 4368 == #t~mem48;havoc #t~mem48; {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {7708#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {7708#true} is VALID [2022-04-28 15:13:08,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {7708#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7708#true} is VALID [2022-04-28 15:13:08,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {7708#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} ~skip~0 := 0; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !false; {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} is VALID [2022-04-28 15:13:08,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {7713#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4416))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7714#(not (= |ssl3_connect_#t~mem54| 4416))} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 54: Hoare triple {7714#(not (= |ssl3_connect_#t~mem54| 4416))} assume 4416 == #t~mem54;havoc #t~mem54; {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {7709#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {7709#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {7709#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {7709#false} assume !(0 == ~tmp___6~0); {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 59: Hoare triple {7709#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 60: Hoare triple {7709#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7709#false} is VALID [2022-04-28 15:13:08,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {7709#false} ~skip~0 := 0; {7709#false} is VALID [2022-04-28 15:13:08,998 INFO L290 TraceCheckUtils]: 62: Hoare triple {7709#false} assume !false; {7709#false} is VALID [2022-04-28 15:13:09,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {7709#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,000 INFO L290 TraceCheckUtils]: 64: Hoare triple {7709#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {7709#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {7709#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {7709#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {7709#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {7709#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {7709#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,006 INFO L290 TraceCheckUtils]: 71: Hoare triple {7709#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {7709#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,008 INFO L290 TraceCheckUtils]: 73: Hoare triple {7709#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {7709#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {7709#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {7709#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7709#false} is VALID [2022-04-28 15:13:09,009 INFO L290 TraceCheckUtils]: 77: Hoare triple {7709#false} assume 4432 == #t~mem56;havoc #t~mem56; {7709#false} is VALID [2022-04-28 15:13:09,009 INFO L290 TraceCheckUtils]: 78: Hoare triple {7709#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7709#false} is VALID [2022-04-28 15:13:09,009 INFO L290 TraceCheckUtils]: 79: Hoare triple {7709#false} assume 5 == ~blastFlag~0; {7709#false} is VALID [2022-04-28 15:13:09,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {7709#false} assume !false; {7709#false} is VALID [2022-04-28 15:13:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 15:13:09,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:13:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712119710] [2022-04-28 15:13:09,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712119710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:09,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:09,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:09,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:13:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1027828549] [2022-04-28 15:13:09,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1027828549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:09,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:09,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658755958] [2022-04-28 15:13:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:13:09,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-28 15:13:09,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:13:09,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:09,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:09,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:13:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:13:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:13:09,067 INFO L87 Difference]: Start difference. First operand 324 states and 502 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:11,088 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-28 15:13:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:12,092 INFO L93 Difference]: Finished difference Result 817 states and 1258 transitions. [2022-04-28 15:13:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:13:12,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-28 15:13:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 15:13:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 15:13:12,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 15:13:12,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:12,473 INFO L225 Difference]: With dead ends: 817 [2022-04-28 15:13:12,473 INFO L226 Difference]: Without dead ends: 509 [2022-04-28 15:13:12,474 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-28 15:13:12,474 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 109 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:12,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:13:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-04-28 15:13:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 368. [2022-04-28 15:13:12,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:12,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 368 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 363 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,494 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 368 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 363 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,494 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 368 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 363 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:12,505 INFO L93 Difference]: Finished difference Result 509 states and 772 transitions. [2022-04-28 15:13:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 772 transitions. [2022-04-28 15:13:12,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:12,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:12,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 363 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 509 states. [2022-04-28 15:13:12,507 INFO L87 Difference]: Start difference. First operand has 368 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 363 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 509 states. [2022-04-28 15:13:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:12,518 INFO L93 Difference]: Finished difference Result 509 states and 772 transitions. [2022-04-28 15:13:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 772 transitions. [2022-04-28 15:13:12,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:12,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:12,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:12,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 363 states have internal predecessors, (572), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 576 transitions. [2022-04-28 15:13:12,528 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 576 transitions. Word has length 81 [2022-04-28 15:13:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:12,528 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 576 transitions. [2022-04-28 15:13:12,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:12,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 368 states and 576 transitions. [2022-04-28 15:13:12,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 576 transitions. [2022-04-28 15:13:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 15:13:12,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:12,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:13:12,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:13:12,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -295498385, now seen corresponding path program 1 times [2022-04-28 15:13:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:12,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495981968] [2022-04-28 15:13:12,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:13:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -295498385, now seen corresponding path program 2 times [2022-04-28 15:13:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:13:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516738305] [2022-04-28 15:13:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:13:12,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:13:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:13,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:13:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:13,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(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(196, 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); {11108#true} is VALID [2022-04-28 15:13:13,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {11108#true} assume true; {11108#true} is VALID [2022-04-28 15:13:13,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11108#true} {11108#true} #592#return; {11108#true} is VALID [2022-04-28 15:13:13,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {11108#true} call ULTIMATE.init(); {11115#(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-28 15:13:13,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {11115#(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(196, 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); {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {11108#true} assume true; {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11108#true} {11108#true} #592#return; {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {11108#true} call #t~ret159 := main(); {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {11108#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {11108#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {11108#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {11108#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {11108#true} is VALID [2022-04-28 15:13:13,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {11108#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {11108#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {11108#true} assume !false; {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {11108#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {11108#true} assume 12292 == #t~mem43;havoc #t~mem43; {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {11108#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {11108#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {11108#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {11108#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {11108#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {11108#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {11108#true} is VALID [2022-04-28 15:13:13,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {11108#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {11108#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {11108#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {11108#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {11108#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {11108#true} ~skip~0 := 0; {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {11108#true} assume !false; {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {11108#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {11108#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {11108#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {11108#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {11108#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {11108#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11108#true} is VALID [2022-04-28 15:13:13,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {11108#true} assume 4368 == #t~mem48;havoc #t~mem48; {11108#true} is VALID [2022-04-28 15:13:13,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {11108#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {11108#true} is VALID [2022-04-28 15:13:13,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {11108#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11108#true} is VALID [2022-04-28 15:13:13,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {11108#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {11113#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11114#(not (= |ssl3_connect_#t~mem55| 4417))} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {11114#(not (= |ssl3_connect_#t~mem55| 4417))} assume 4417 == #t~mem55;havoc #t~mem55; {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {11109#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {11109#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {11109#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {11109#false} assume !(0 == ~tmp___6~0); {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {11109#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {11109#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11109#false} is VALID [2022-04-28 15:13:13,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {11109#false} ~skip~0 := 0; {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {11109#false} assume !false; {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {11109#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {11109#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {11109#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {11109#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {11109#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {11109#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {11109#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {11109#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {11109#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {11109#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {11109#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {11109#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L290 TraceCheckUtils]: 76: Hoare triple {11109#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {11109#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L290 TraceCheckUtils]: 78: Hoare triple {11109#false} assume 4432 == #t~mem56;havoc #t~mem56; {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {11109#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {11109#false} assume 5 == ~blastFlag~0; {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {11109#false} assume !false; {11109#false} is VALID [2022-04-28 15:13:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 15:13:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:13:13,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516738305] [2022-04-28 15:13:13,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516738305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:13,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:13,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:13,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:13:13,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495981968] [2022-04-28 15:13:13,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495981968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:13,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:13,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404908185] [2022-04-28 15:13:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:13:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 15:13:13,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:13:13,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:13,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:13,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:13:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:13,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:13:13,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:13:13,228 INFO L87 Difference]: Start difference. First operand 368 states and 576 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:15,250 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-28 15:13:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:16,267 INFO L93 Difference]: Finished difference Result 855 states and 1320 transitions. [2022-04-28 15:13:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:13:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 15:13:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 15:13:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-28 15:13:16,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-28 15:13:16,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:16,637 INFO L225 Difference]: With dead ends: 855 [2022-04-28 15:13:16,637 INFO L226 Difference]: Without dead ends: 503 [2022-04-28 15:13:16,638 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-28 15:13:16,638 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 108 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:16,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 296 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:13:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-04-28 15:13:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2022-04-28 15:13:16,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:16,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 368 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 363 states have internal predecessors, (568), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,654 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 368 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 363 states have internal predecessors, (568), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,654 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 368 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 363 states have internal predecessors, (568), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:16,664 INFO L93 Difference]: Finished difference Result 503 states and 760 transitions. [2022-04-28 15:13:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 760 transitions. [2022-04-28 15:13:16,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:16,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:16,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 363 states have internal predecessors, (568), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-28 15:13:16,666 INFO L87 Difference]: Start difference. First operand has 368 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 363 states have internal predecessors, (568), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-28 15:13:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:16,677 INFO L93 Difference]: Finished difference Result 503 states and 760 transitions. [2022-04-28 15:13:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 760 transitions. [2022-04-28 15:13:16,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:16,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:16,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:16,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 363 states have (on average 1.5647382920110193) internal successors, (568), 363 states have internal predecessors, (568), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 572 transitions. [2022-04-28 15:13:16,697 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 572 transitions. Word has length 82 [2022-04-28 15:13:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:16,697 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 572 transitions. [2022-04-28 15:13:16,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:16,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 368 states and 572 transitions. [2022-04-28 15:13:17,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 572 transitions. [2022-04-28 15:13:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 15:13:17,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:17,147 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:13:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:13:17,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 431863133, now seen corresponding path program 1 times [2022-04-28 15:13:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676414081] [2022-04-28 15:13:17,148 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:13:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 431863133, now seen corresponding path program 2 times [2022-04-28 15:13:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:13:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290925593] [2022-04-28 15:13:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:13:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:13:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:13:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:17,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {14579#(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(196, 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); {14572#true} is VALID [2022-04-28 15:13:17,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {14572#true} assume true; {14572#true} is VALID [2022-04-28 15:13:17,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14572#true} {14572#true} #592#return; {14572#true} is VALID [2022-04-28 15:13:17,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {14572#true} call ULTIMATE.init(); {14579#(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-28 15:13:17,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {14579#(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(196, 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); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {14572#true} assume true; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14572#true} {14572#true} #592#return; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {14572#true} call #t~ret159 := main(); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {14572#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {14572#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {14572#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {14572#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {14572#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {14572#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {14572#true} assume !false; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {14572#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {14572#true} assume 12292 == #t~mem43;havoc #t~mem43; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {14572#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {14572#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {14572#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {14572#true} is VALID [2022-04-28 15:13:17,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {14572#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {14572#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {14572#true} is VALID [2022-04-28 15:13:17,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {14572#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {14572#true} is VALID [2022-04-28 15:13:17,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {14572#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {14572#true} is VALID [2022-04-28 15:13:17,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {14572#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {14572#true} is VALID [2022-04-28 15:13:17,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {14572#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {14572#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {14572#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14572#true} is VALID [2022-04-28 15:13:17,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {14572#true} ~skip~0 := 0; {14572#true} is VALID [2022-04-28 15:13:17,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {14572#true} assume !false; {14572#true} is VALID [2022-04-28 15:13:17,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {14572#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {14572#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {14572#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {14572#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {14572#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {14572#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {14572#true} assume 4368 == #t~mem48;havoc #t~mem48; {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {14572#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {14572#true} is VALID [2022-04-28 15:13:17,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {14572#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14572#true} is VALID [2022-04-28 15:13:17,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {14572#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:17,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {14577#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14578#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {14578#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {14573#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {14573#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {14573#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {14573#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {14573#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {14573#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {14573#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {14573#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {14573#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {14573#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {14573#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {14573#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {14573#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {14573#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {14573#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {14573#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 67: Hoare triple {14573#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {14573#false} assume 4512 == #t~mem68;havoc #t~mem68; {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {14573#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {14573#false} is VALID [2022-04-28 15:13:17,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {14573#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 71: Hoare triple {14573#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {14573#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {14573#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {14573#false} assume !(0 == ~tmp___8~0); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {14573#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 76: Hoare triple {14573#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 77: Hoare triple {14573#false} ~skip~0 := 0; {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 78: Hoare triple {14573#false} assume !false; {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 79: Hoare triple {14573#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 80: Hoare triple {14573#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {14573#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {14573#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {14573#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {14573#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {14573#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {14573#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,318 INFO L290 TraceCheckUtils]: 87: Hoare triple {14573#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 88: Hoare triple {14573#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 89: Hoare triple {14573#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 90: Hoare triple {14573#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 91: Hoare triple {14573#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 92: Hoare triple {14573#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 93: Hoare triple {14573#false} assume 4432 == #t~mem56;havoc #t~mem56; {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 94: Hoare triple {14573#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 95: Hoare triple {14573#false} assume 5 == ~blastFlag~0; {14573#false} is VALID [2022-04-28 15:13:17,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {14573#false} assume !false; {14573#false} is VALID [2022-04-28 15:13:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 15:13:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:13:17,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290925593] [2022-04-28 15:13:17,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290925593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:17,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:17,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:17,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:13:17,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676414081] [2022-04-28 15:13:17,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676414081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:17,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:17,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483695086] [2022-04-28 15:13:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:13:17,321 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 97 [2022-04-28 15:13:17,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:13:17,321 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-28 15:13:17,382 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-28 15:13:17,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:13:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:13:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:13:17,383 INFO L87 Difference]: Start difference. First operand 368 states and 572 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-28 15:13:19,415 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-28 15:13:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:20,400 INFO L93 Difference]: Finished difference Result 581 states and 906 transitions. [2022-04-28 15:13:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:13:20,400 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 97 [2022-04-28 15:13:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:20,400 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-28 15:13:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-28 15:13:20,402 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-28 15:13:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-28 15:13:20,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-28 15:13:20,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:20,698 INFO L225 Difference]: With dead ends: 581 [2022-04-28 15:13:20,698 INFO L226 Difference]: Without dead ends: 403 [2022-04-28 15:13:20,699 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-28 15:13:20,700 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:20,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:13:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-28 15:13:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 386. [2022-04-28 15:13:20,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:20,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 386 states, 381 states have (on average 1.5695538057742782) internal successors, (598), 381 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:20,715 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 386 states, 381 states have (on average 1.5695538057742782) internal successors, (598), 381 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:20,716 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 386 states, 381 states have (on average 1.5695538057742782) internal successors, (598), 381 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:20,724 INFO L93 Difference]: Finished difference Result 403 states and 624 transitions. [2022-04-28 15:13:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 624 transitions. [2022-04-28 15:13:20,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:20,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:20,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5695538057742782) internal successors, (598), 381 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-28 15:13:20,726 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5695538057742782) internal successors, (598), 381 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-28 15:13:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:20,735 INFO L93 Difference]: Finished difference Result 403 states and 624 transitions. [2022-04-28 15:13:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 624 transitions. [2022-04-28 15:13:20,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:20,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:20,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:20,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5695538057742782) internal successors, (598), 381 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 602 transitions. [2022-04-28 15:13:20,747 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 602 transitions. Word has length 97 [2022-04-28 15:13:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:20,747 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 602 transitions. [2022-04-28 15:13:20,747 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-28 15:13:20,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 602 transitions. [2022-04-28 15:13:21,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 602 transitions. [2022-04-28 15:13:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 15:13:21,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:21,217 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:13:21,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:13:21,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1171691203, now seen corresponding path program 3 times [2022-04-28 15:13:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:21,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463380260] [2022-04-28 15:13:33,564 WARN L232 SmtUtils]: Spent 9.56s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:13:44,200 WARN L232 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:13:44,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:13:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1171691203, now seen corresponding path program 4 times [2022-04-28 15:13:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:13:44,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622239001] [2022-04-28 15:13:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:13:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:13:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:13:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:13:45,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {17331#(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(196, 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); {17324#true} is VALID [2022-04-28 15:13:45,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {17324#true} assume true; {17324#true} is VALID [2022-04-28 15:13:45,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17324#true} {17324#true} #592#return; {17324#true} is VALID [2022-04-28 15:13:45,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {17324#true} call ULTIMATE.init(); {17331#(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-28 15:13:45,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {17331#(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(196, 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); {17324#true} is VALID [2022-04-28 15:13:45,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {17324#true} assume true; {17324#true} is VALID [2022-04-28 15:13:45,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17324#true} {17324#true} #592#return; {17324#true} is VALID [2022-04-28 15:13:45,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {17324#true} call #t~ret159 := main(); {17324#true} is VALID [2022-04-28 15:13:45,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {17324#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {17324#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {17324#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {17324#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {17324#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {17324#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {17324#true} assume !false; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {17324#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {17324#true} assume 12292 == #t~mem43;havoc #t~mem43; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {17324#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {17324#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {17324#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {17324#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {17324#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {17324#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {17324#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {17324#true} is VALID [2022-04-28 15:13:45,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {17324#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {17324#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {17324#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {17324#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {17324#true} ~skip~0 := 0; {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {17324#true} assume !false; {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {17324#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {17324#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {17324#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {17324#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {17324#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {17324#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {17324#true} assume 4368 == #t~mem48;havoc #t~mem48; {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {17324#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {17324#true} is VALID [2022-04-28 15:13:45,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {17324#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17324#true} is VALID [2022-04-28 15:13:45,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {17324#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:45,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:45,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:45,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:45,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {17329#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17330#(= |ssl3_connect_#t~mem43| 4384)} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {17330#(= |ssl3_connect_#t~mem43| 4384)} assume 12292 == #t~mem43;havoc #t~mem43; {17325#false} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {17325#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {17325#false} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {17325#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {17325#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {17325#false} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {17325#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {17325#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {17325#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {17325#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {17325#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {17325#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {17325#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {17325#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {17325#false} ~skip~0 := 0; {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {17325#false} assume !false; {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {17325#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {17325#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {17325#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {17325#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {17325#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {17325#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {17325#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 64: Hoare triple {17325#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {17325#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {17325#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {17325#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {17325#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {17325#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 70: Hoare triple {17325#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 71: Hoare triple {17325#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {17325#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {17325#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {17325#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {17325#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {17325#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {17325#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {17325#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {17325#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {17325#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {17325#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 82: Hoare triple {17325#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 83: Hoare triple {17325#false} assume 4512 == #t~mem68;havoc #t~mem68; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {17325#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {17325#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 86: Hoare triple {17325#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 87: Hoare triple {17325#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {17325#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {17325#false} assume !(0 == ~tmp___8~0); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 90: Hoare triple {17325#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 91: Hoare triple {17325#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 92: Hoare triple {17325#false} ~skip~0 := 0; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 93: Hoare triple {17325#false} assume !false; {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 94: Hoare triple {17325#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 95: Hoare triple {17325#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 96: Hoare triple {17325#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {17325#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 98: Hoare triple {17325#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 99: Hoare triple {17325#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 100: Hoare triple {17325#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {17325#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 102: Hoare triple {17325#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 103: Hoare triple {17325#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {17325#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {17325#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {17325#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {17325#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 108: Hoare triple {17325#false} assume 4432 == #t~mem56;havoc #t~mem56; {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 109: Hoare triple {17325#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 110: Hoare triple {17325#false} assume 5 == ~blastFlag~0; {17325#false} is VALID [2022-04-28 15:13:45,185 INFO L290 TraceCheckUtils]: 111: Hoare triple {17325#false} assume !false; {17325#false} is VALID [2022-04-28 15:13:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 15:13:45,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:13:45,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622239001] [2022-04-28 15:13:45,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622239001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:45,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:45,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:45,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:13:45,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463380260] [2022-04-28 15:13:45,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463380260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:13:45,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:13:45,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:13:45,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247418844] [2022-04-28 15:13:45,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:13:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 15:13:45,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:13:45,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:45,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:45,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:13:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:13:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:13:45,260 INFO L87 Difference]: Start difference. First operand 386 states and 602 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:47,281 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-28 15:13:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:48,234 INFO L93 Difference]: Finished difference Result 598 states and 934 transitions. [2022-04-28 15:13:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:13:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 15:13:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:13:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-28 15:13:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-28 15:13:48,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-28 15:13:48,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:48,520 INFO L225 Difference]: With dead ends: 598 [2022-04-28 15:13:48,520 INFO L226 Difference]: Without dead ends: 402 [2022-04-28 15:13:48,521 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-28 15:13:48,521 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:13:48,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 490 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:13:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-28 15:13:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 386. [2022-04-28 15:13:48,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:13:48,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,548 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,548 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:48,555 INFO L93 Difference]: Finished difference Result 402 states and 622 transitions. [2022-04-28 15:13:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 622 transitions. [2022-04-28 15:13:48,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:48,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:48,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 402 states. [2022-04-28 15:13:48,557 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 402 states. [2022-04-28 15:13:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:13:48,580 INFO L93 Difference]: Finished difference Result 402 states and 622 transitions. [2022-04-28 15:13:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 622 transitions. [2022-04-28 15:13:48,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:13:48,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:13:48,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:13:48,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:13:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5669291338582678) internal successors, (597), 381 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 601 transitions. [2022-04-28 15:13:48,590 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 601 transitions. Word has length 112 [2022-04-28 15:13:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:13:48,590 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 601 transitions. [2022-04-28 15:13:48,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:13:48,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 601 transitions. [2022-04-28 15:13:49,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:13:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 601 transitions. [2022-04-28 15:13:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 15:13:49,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:13:49,084 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:13:49,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:13:49,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:13:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:13:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1673263717, now seen corresponding path program 1 times [2022-04-28 15:13:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:13:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2098679468] [2022-04-28 15:14:09,574 WARN L232 SmtUtils]: Spent 11.80s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:14:18,420 WARN L232 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:14:19,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:14:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1673263717, now seen corresponding path program 2 times [2022-04-28 15:14:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:14:19,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091138486] [2022-04-28 15:14:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:14:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:14:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:14:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:14:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:14:19,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {20115#(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(196, 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); {20108#true} is VALID [2022-04-28 15:14:19,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {20108#true} assume true; {20108#true} is VALID [2022-04-28 15:14:19,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20108#true} {20108#true} #592#return; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {20108#true} call ULTIMATE.init(); {20115#(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-28 15:14:19,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {20115#(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(196, 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); {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {20108#true} assume true; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20108#true} {20108#true} #592#return; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {20108#true} call #t~ret159 := main(); {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {20108#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {20108#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {20108#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {20108#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {20108#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {20108#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {20108#true} assume !false; {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {20108#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {20108#true} assume 12292 == #t~mem43;havoc #t~mem43; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {20108#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {20108#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {20108#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {20108#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {20108#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {20108#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {20108#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {20108#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {20108#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {20108#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {20108#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {20108#true} ~skip~0 := 0; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {20108#true} assume !false; {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {20108#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {20108#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {20108#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {20108#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {20108#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {20108#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20108#true} is VALID [2022-04-28 15:14:19,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {20108#true} assume 4368 == #t~mem48;havoc #t~mem48; {20108#true} is VALID [2022-04-28 15:14:19,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {20108#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {20108#true} is VALID [2022-04-28 15:14:19,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {20108#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20108#true} is VALID [2022-04-28 15:14:19,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {20108#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} ~skip~0 := 0; {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !false; {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {20113#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 16384))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20114#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {20114#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {20109#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {20109#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {20109#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {20109#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {20109#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {20109#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {20109#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {20109#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {20109#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {20109#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {20109#false} ~skip~0 := 0; {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {20109#false} assume !false; {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {20109#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {20109#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {20109#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {20109#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {20109#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {20109#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {20109#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {20109#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {20109#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {20109#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {20109#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 68: Hoare triple {20109#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {20109#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {20109#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 71: Hoare triple {20109#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {20109#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {20109#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {20109#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {20109#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {20109#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {20109#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {20109#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {20109#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {20109#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {20109#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {20109#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {20109#false} assume 4512 == #t~mem68;havoc #t~mem68; {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {20109#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 85: Hoare triple {20109#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 86: Hoare triple {20109#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 87: Hoare triple {20109#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {20109#false} is VALID [2022-04-28 15:14:19,384 INFO L290 TraceCheckUtils]: 88: Hoare triple {20109#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {20109#false} assume !(0 == ~tmp___8~0); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {20109#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {20109#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {20109#false} ~skip~0 := 0; {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {20109#false} assume !false; {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {20109#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 95: Hoare triple {20109#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {20109#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {20109#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {20109#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 99: Hoare triple {20109#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 100: Hoare triple {20109#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 101: Hoare triple {20109#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 102: Hoare triple {20109#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 103: Hoare triple {20109#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {20109#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 105: Hoare triple {20109#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,385 INFO L290 TraceCheckUtils]: 106: Hoare triple {20109#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {20109#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20109#false} is VALID [2022-04-28 15:14:19,386 INFO L290 TraceCheckUtils]: 108: Hoare triple {20109#false} assume 4432 == #t~mem56;havoc #t~mem56; {20109#false} is VALID [2022-04-28 15:14:19,386 INFO L290 TraceCheckUtils]: 109: Hoare triple {20109#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {20109#false} is VALID [2022-04-28 15:14:19,386 INFO L290 TraceCheckUtils]: 110: Hoare triple {20109#false} assume 5 == ~blastFlag~0; {20109#false} is VALID [2022-04-28 15:14:19,386 INFO L290 TraceCheckUtils]: 111: Hoare triple {20109#false} assume !false; {20109#false} is VALID [2022-04-28 15:14:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 15:14:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:14:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091138486] [2022-04-28 15:14:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091138486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:14:19,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:14:19,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:14:19,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:14:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2098679468] [2022-04-28 15:14:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2098679468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:14:19,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:14:19,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:14:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694697514] [2022-04-28 15:14:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:14:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 15:14:19,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:14:19,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:19,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:14:19,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:14:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:14:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:14:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:14:19,456 INFO L87 Difference]: Start difference. First operand 386 states and 601 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:21,477 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-28 15:14:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:14:22,403 INFO L93 Difference]: Finished difference Result 891 states and 1370 transitions. [2022-04-28 15:14:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:14:22,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-28 15:14:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:14:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 15:14:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 15:14:22,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 15:14:22,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:14:22,761 INFO L225 Difference]: With dead ends: 891 [2022-04-28 15:14:22,761 INFO L226 Difference]: Without dead ends: 521 [2022-04-28 15:14:22,762 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-28 15:14:22,762 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 118 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:14:22,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 296 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:14:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-04-28 15:14:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 386. [2022-04-28 15:14:22,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:14:22,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5485564304461943) internal successors, (590), 381 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,777 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5485564304461943) internal successors, (590), 381 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,778 INFO L87 Difference]: Start difference. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5485564304461943) internal successors, (590), 381 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:14:22,788 INFO L93 Difference]: Finished difference Result 521 states and 782 transitions. [2022-04-28 15:14:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 782 transitions. [2022-04-28 15:14:22,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:14:22,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:14:22,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5485564304461943) internal successors, (590), 381 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:14:22,790 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5485564304461943) internal successors, (590), 381 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:14:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:14:22,801 INFO L93 Difference]: Finished difference Result 521 states and 782 transitions. [2022-04-28 15:14:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 782 transitions. [2022-04-28 15:14:22,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:14:22,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:14:22,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:14:22,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:14:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5485564304461943) internal successors, (590), 381 states have internal predecessors, (590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2022-04-28 15:14:22,812 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 112 [2022-04-28 15:14:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:14:22,812 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2022-04-28 15:14:22,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:22,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 594 transitions. [2022-04-28 15:14:23,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:14:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2022-04-28 15:14:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 15:14:23,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:14:23,269 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:14:23,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:14:23,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:14:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:14:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash 232485930, now seen corresponding path program 1 times [2022-04-28 15:14:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:14:23,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837608932] [2022-04-28 15:14:40,537 WARN L232 SmtUtils]: Spent 9.53s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:14:50,874 WARN L232 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:14:51,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:14:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 232485930, now seen corresponding path program 2 times [2022-04-28 15:14:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:14:51,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075023633] [2022-04-28 15:14:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:14:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:14:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:14:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:14:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:14:51,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {23723#(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(196, 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); {23716#true} is VALID [2022-04-28 15:14:51,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {23716#true} assume true; {23716#true} is VALID [2022-04-28 15:14:51,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23716#true} {23716#true} #592#return; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {23716#true} call ULTIMATE.init(); {23723#(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-28 15:14:51,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {23723#(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(196, 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); {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {23716#true} assume true; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23716#true} {23716#true} #592#return; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {23716#true} call #t~ret159 := main(); {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {23716#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {23716#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {23716#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {23716#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {23716#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {23716#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {23716#true} assume !false; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {23716#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {23716#true} assume 12292 == #t~mem43;havoc #t~mem43; {23716#true} is VALID [2022-04-28 15:14:51,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {23716#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {23716#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {23716#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {23716#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {23716#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {23716#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {23716#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {23716#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {23716#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {23716#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {23716#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {23716#true} ~skip~0 := 0; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {23716#true} assume !false; {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {23716#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {23716#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {23716#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {23716#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {23716#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {23716#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23716#true} is VALID [2022-04-28 15:14:51,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {23716#true} assume 4368 == #t~mem48;havoc #t~mem48; {23716#true} is VALID [2022-04-28 15:14:51,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {23716#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {23716#true} is VALID [2022-04-28 15:14:51,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {23716#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23716#true} is VALID [2022-04-28 15:14:51,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {23716#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} ~skip~0 := 0; {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !false; {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {23721#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4096))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23722#(not (= |ssl3_connect_#t~mem45| 4096))} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {23722#(not (= |ssl3_connect_#t~mem45| 4096))} assume 4096 == #t~mem45;havoc #t~mem45; {23717#false} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {23717#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {23717#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23717#false} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {23717#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {23717#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23717#false} is VALID [2022-04-28 15:14:51,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {23717#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {23717#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 52: Hoare triple {23717#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {23717#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {23717#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {23717#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {23717#false} ~skip~0 := 0; {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {23717#false} assume !false; {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {23717#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {23717#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {23717#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {23717#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {23717#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {23717#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {23717#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {23717#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 66: Hoare triple {23717#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 67: Hoare triple {23717#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,863 INFO L290 TraceCheckUtils]: 68: Hoare triple {23717#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {23717#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {23717#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {23717#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {23717#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {23717#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {23717#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {23717#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {23717#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {23717#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {23717#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 79: Hoare triple {23717#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {23717#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {23717#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {23717#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {23717#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {23717#false} assume 4512 == #t~mem68;havoc #t~mem68; {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {23717#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {23717#false} is VALID [2022-04-28 15:14:51,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {23717#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 87: Hoare triple {23717#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {23717#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {23717#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 90: Hoare triple {23717#false} assume !(0 == ~tmp___8~0); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 91: Hoare triple {23717#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 92: Hoare triple {23717#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 93: Hoare triple {23717#false} ~skip~0 := 0; {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 94: Hoare triple {23717#false} assume !false; {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 95: Hoare triple {23717#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 96: Hoare triple {23717#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 97: Hoare triple {23717#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 98: Hoare triple {23717#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 99: Hoare triple {23717#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 100: Hoare triple {23717#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 101: Hoare triple {23717#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 102: Hoare triple {23717#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,865 INFO L290 TraceCheckUtils]: 103: Hoare triple {23717#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 104: Hoare triple {23717#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 105: Hoare triple {23717#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 106: Hoare triple {23717#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 107: Hoare triple {23717#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 108: Hoare triple {23717#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 109: Hoare triple {23717#false} assume 4432 == #t~mem56;havoc #t~mem56; {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 110: Hoare triple {23717#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 111: Hoare triple {23717#false} assume 5 == ~blastFlag~0; {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L290 TraceCheckUtils]: 112: Hoare triple {23717#false} assume !false; {23717#false} is VALID [2022-04-28 15:14:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 15:14:51,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:14:51,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075023633] [2022-04-28 15:14:51,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075023633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:14:51,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:14:51,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:14:51,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:14:51,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837608932] [2022-04-28 15:14:51,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837608932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:14:51,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:14:51,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:14:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671544042] [2022-04-28 15:14:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:14:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-28 15:14:51,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:14:51,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:51,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:14:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:14:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:14:51,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:14:51,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:14:51,938 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:53,959 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-28 15:14:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:14:54,965 INFO L93 Difference]: Finished difference Result 891 states and 1356 transitions. [2022-04-28 15:14:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:14:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-28 15:14:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:14:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 15:14:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 15:14:54,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 15:14:55,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:14:55,286 INFO L225 Difference]: With dead ends: 891 [2022-04-28 15:14:55,286 INFO L226 Difference]: Without dead ends: 521 [2022-04-28 15:14:55,287 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-28 15:14:55,287 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:14:55,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 318 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 402 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:14:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-04-28 15:14:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 386. [2022-04-28 15:14:55,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:14:55,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5301837270341208) internal successors, (583), 381 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:55,303 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5301837270341208) internal successors, (583), 381 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:55,303 INFO L87 Difference]: Start difference. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5301837270341208) internal successors, (583), 381 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:14:55,312 INFO L93 Difference]: Finished difference Result 521 states and 775 transitions. [2022-04-28 15:14:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 775 transitions. [2022-04-28 15:14:55,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:14:55,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:14:55,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5301837270341208) internal successors, (583), 381 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:14:55,314 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5301837270341208) internal successors, (583), 381 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:14:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:14:55,323 INFO L93 Difference]: Finished difference Result 521 states and 775 transitions. [2022-04-28 15:14:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 775 transitions. [2022-04-28 15:14:55,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:14:55,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:14:55,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:14:55,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:14:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5301837270341208) internal successors, (583), 381 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 587 transitions. [2022-04-28 15:14:55,331 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 587 transitions. Word has length 113 [2022-04-28 15:14:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:14:55,331 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 587 transitions. [2022-04-28 15:14:55,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:14:55,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 587 transitions. [2022-04-28 15:14:55,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:14:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 587 transitions. [2022-04-28 15:14:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 15:14:55,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:14:55,784 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:14:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:14:55,785 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:14:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:14:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1244585760, now seen corresponding path program 1 times [2022-04-28 15:14:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:14:55,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688466951] [2022-04-28 15:15:04,432 WARN L232 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 198 DAG size of output: 190 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:15:16,219 WARN L232 SmtUtils]: Spent 10.50s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:15:25,963 WARN L232 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:15:26,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:15:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1244585760, now seen corresponding path program 2 times [2022-04-28 15:15:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:26,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714448217] [2022-04-28 15:15:26,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:26,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {27331#(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(196, 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); {27324#true} is VALID [2022-04-28 15:15:26,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {27324#true} assume true; {27324#true} is VALID [2022-04-28 15:15:26,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27324#true} {27324#true} #592#return; {27324#true} is VALID [2022-04-28 15:15:26,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {27324#true} call ULTIMATE.init(); {27331#(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-28 15:15:26,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {27331#(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(196, 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); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {27324#true} assume true; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27324#true} {27324#true} #592#return; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {27324#true} call #t~ret159 := main(); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {27324#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {27324#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {27324#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {27324#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {27324#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {27324#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {27324#true} assume !false; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {27324#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {27324#true} assume 12292 == #t~mem43;havoc #t~mem43; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {27324#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {27324#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {27324#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27324#true} is VALID [2022-04-28 15:15:26,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {27324#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {27324#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {27324#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {27324#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {27324#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {27324#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {27324#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#true} ~skip~0 := 0; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#true} assume !false; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {27324#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {27324#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {27324#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {27324#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {27324#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {27324#true} assume 4368 == #t~mem48;havoc #t~mem48; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {27324#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {27324#true} is VALID [2022-04-28 15:15:26,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {27324#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27324#true} is VALID [2022-04-28 15:15:26,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {27324#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:26,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {27329#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27330#(not (= |ssl3_connect_#t~mem46| 20480))} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {27330#(not (= |ssl3_connect_#t~mem46| 20480))} assume 20480 == #t~mem46;havoc #t~mem46; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {27325#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {27325#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {27325#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {27325#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {27325#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {27325#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {27325#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {27325#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {27325#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {27325#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {27325#false} ~skip~0 := 0; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {27325#false} assume !false; {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {27325#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {27325#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {27325#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {27325#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 63: Hoare triple {27325#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {27325#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 65: Hoare triple {27325#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {27325#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {27325#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {27325#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {27325#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {27325#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {27325#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {27325#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {27325#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {27325#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {27325#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {27325#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {27325#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,907 INFO L290 TraceCheckUtils]: 78: Hoare triple {27325#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {27325#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {27325#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {27325#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {27325#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {27325#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {27325#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {27325#false} assume 4512 == #t~mem68;havoc #t~mem68; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {27325#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 87: Hoare triple {27325#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 88: Hoare triple {27325#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {27325#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {27325#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 91: Hoare triple {27325#false} assume !(0 == ~tmp___8~0); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 92: Hoare triple {27325#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 93: Hoare triple {27325#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 94: Hoare triple {27325#false} ~skip~0 := 0; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 95: Hoare triple {27325#false} assume !false; {27325#false} is VALID [2022-04-28 15:15:26,908 INFO L290 TraceCheckUtils]: 96: Hoare triple {27325#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 97: Hoare triple {27325#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 98: Hoare triple {27325#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 99: Hoare triple {27325#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 100: Hoare triple {27325#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 101: Hoare triple {27325#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 102: Hoare triple {27325#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 103: Hoare triple {27325#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 104: Hoare triple {27325#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 105: Hoare triple {27325#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 106: Hoare triple {27325#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 107: Hoare triple {27325#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 108: Hoare triple {27325#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 109: Hoare triple {27325#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 110: Hoare triple {27325#false} assume 4432 == #t~mem56;havoc #t~mem56; {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 111: Hoare triple {27325#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 112: Hoare triple {27325#false} assume 5 == ~blastFlag~0; {27325#false} is VALID [2022-04-28 15:15:26,909 INFO L290 TraceCheckUtils]: 113: Hoare triple {27325#false} assume !false; {27325#false} is VALID [2022-04-28 15:15:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 15:15:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714448217] [2022-04-28 15:15:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714448217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:26,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:26,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688466951] [2022-04-28 15:15:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688466951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:26,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598498191] [2022-04-28 15:15:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-28 15:15:26,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:26,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:26,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:26,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:15:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:26,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:15:26,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:15:26,972 INFO L87 Difference]: Start difference. First operand 386 states and 587 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:28,991 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-28 15:15:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:29,940 INFO L93 Difference]: Finished difference Result 891 states and 1342 transitions. [2022-04-28 15:15:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:15:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-28 15:15:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 15:15:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 15:15:29,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-28 15:15:30,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:30,258 INFO L225 Difference]: With dead ends: 891 [2022-04-28 15:15:30,258 INFO L226 Difference]: Without dead ends: 521 [2022-04-28 15:15:30,259 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-28 15:15:30,259 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 114 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 296 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:15:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-04-28 15:15:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 386. [2022-04-28 15:15:30,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:30,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5118110236220472) internal successors, (576), 381 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:30,278 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5118110236220472) internal successors, (576), 381 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:30,278 INFO L87 Difference]: Start difference. First operand 521 states. Second operand has 386 states, 381 states have (on average 1.5118110236220472) internal successors, (576), 381 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:30,287 INFO L93 Difference]: Finished difference Result 521 states and 768 transitions. [2022-04-28 15:15:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 768 transitions. [2022-04-28 15:15:30,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:30,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:30,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5118110236220472) internal successors, (576), 381 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:15:30,289 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5118110236220472) internal successors, (576), 381 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 521 states. [2022-04-28 15:15:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:30,306 INFO L93 Difference]: Finished difference Result 521 states and 768 transitions. [2022-04-28 15:15:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 768 transitions. [2022-04-28 15:15:30,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:30,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:30,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:30,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5118110236220472) internal successors, (576), 381 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 580 transitions. [2022-04-28 15:15:30,314 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 580 transitions. Word has length 114 [2022-04-28 15:15:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:30,314 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 580 transitions. [2022-04-28 15:15:30,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:30,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 580 transitions. [2022-04-28 15:15:30,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 580 transitions. [2022-04-28 15:15:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 15:15:30,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:30,765 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:15:30,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:15:30,766 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash 448198853, now seen corresponding path program 1 times [2022-04-28 15:15:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:30,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [23825306] [2022-04-28 15:15:53,266 WARN L232 SmtUtils]: Spent 13.93s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:16:01,971 WARN L232 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:16:02,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash 448198853, now seen corresponding path program 2 times [2022-04-28 15:16:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:02,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456428228] [2022-04-28 15:16:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:02,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:02,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {30939#(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(196, 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); {30932#true} is VALID [2022-04-28 15:16:02,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {30932#true} assume true; {30932#true} is VALID [2022-04-28 15:16:02,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30932#true} {30932#true} #592#return; {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {30932#true} call ULTIMATE.init(); {30939#(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-28 15:16:02,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {30939#(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(196, 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); {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {30932#true} assume true; {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30932#true} {30932#true} #592#return; {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {30932#true} call #t~ret159 := main(); {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {30932#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {30932#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {30932#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {30932#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {30932#true} is VALID [2022-04-28 15:16:02,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {30932#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {30932#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {30932#true} assume !false; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {30932#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {30932#true} assume 12292 == #t~mem43;havoc #t~mem43; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {30932#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {30932#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {30932#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {30932#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {30932#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {30932#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {30932#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {30932#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {30932#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {30932#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {30932#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30932#true} is VALID [2022-04-28 15:16:02,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {30932#true} ~skip~0 := 0; {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {30932#true} assume !false; {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {30932#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {30932#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {30932#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {30932#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {30932#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {30932#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {30932#true} assume 4368 == #t~mem48;havoc #t~mem48; {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {30932#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {30932#true} is VALID [2022-04-28 15:16:02,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {30932#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30932#true} is VALID [2022-04-28 15:16:02,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {30932#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} ~skip~0 := 0; {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !false; {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {30937#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30938#(= |ssl3_connect_#t~mem47| 4384)} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {30938#(= |ssl3_connect_#t~mem47| 4384)} assume 4099 == #t~mem47;havoc #t~mem47; {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {30933#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {30933#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {30933#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {30933#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {30933#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {30933#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {30933#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {30933#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {30933#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {30933#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {30933#false} ~skip~0 := 0; {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {30933#false} assume !false; {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {30933#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {30933#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 62: Hoare triple {30933#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 63: Hoare triple {30933#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 64: Hoare triple {30933#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {30933#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {30933#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {30933#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {30933#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {30933#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {30933#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {30933#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {30933#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {30933#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {30933#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 75: Hoare triple {30933#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {30933#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 77: Hoare triple {30933#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 78: Hoare triple {30933#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 79: Hoare triple {30933#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 80: Hoare triple {30933#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 81: Hoare triple {30933#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 82: Hoare triple {30933#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 83: Hoare triple {30933#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {30933#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {30933#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 86: Hoare triple {30933#false} assume 4512 == #t~mem68;havoc #t~mem68; {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 87: Hoare triple {30933#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 88: Hoare triple {30933#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {30933#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {30933#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {30933#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {30933#false} is VALID [2022-04-28 15:16:02,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {30933#false} assume !(0 == ~tmp___8~0); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 93: Hoare triple {30933#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 94: Hoare triple {30933#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 95: Hoare triple {30933#false} ~skip~0 := 0; {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 96: Hoare triple {30933#false} assume !false; {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 97: Hoare triple {30933#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {30933#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {30933#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 100: Hoare triple {30933#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 101: Hoare triple {30933#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 102: Hoare triple {30933#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 103: Hoare triple {30933#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 104: Hoare triple {30933#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 105: Hoare triple {30933#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 106: Hoare triple {30933#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 107: Hoare triple {30933#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 108: Hoare triple {30933#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,943 INFO L290 TraceCheckUtils]: 109: Hoare triple {30933#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,944 INFO L290 TraceCheckUtils]: 110: Hoare triple {30933#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30933#false} is VALID [2022-04-28 15:16:02,944 INFO L290 TraceCheckUtils]: 111: Hoare triple {30933#false} assume 4432 == #t~mem56;havoc #t~mem56; {30933#false} is VALID [2022-04-28 15:16:02,944 INFO L290 TraceCheckUtils]: 112: Hoare triple {30933#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {30933#false} is VALID [2022-04-28 15:16:02,944 INFO L290 TraceCheckUtils]: 113: Hoare triple {30933#false} assume 5 == ~blastFlag~0; {30933#false} is VALID [2022-04-28 15:16:02,944 INFO L290 TraceCheckUtils]: 114: Hoare triple {30933#false} assume !false; {30933#false} is VALID [2022-04-28 15:16:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 15:16:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:02,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456428228] [2022-04-28 15:16:02,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456428228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:02,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:02,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:02,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:02,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [23825306] [2022-04-28 15:16:02,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [23825306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:02,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:02,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447684353] [2022-04-28 15:16:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:16:02,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:02,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:03,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:03,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:03,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:03,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:03,018 INFO L87 Difference]: Start difference. First operand 386 states and 580 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:05,038 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-28 15:16:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:05,802 INFO L93 Difference]: Finished difference Result 589 states and 888 transitions. [2022-04-28 15:16:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:16:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-28 15:16:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-28 15:16:05,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 373 transitions. [2022-04-28 15:16:06,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:06,034 INFO L225 Difference]: With dead ends: 589 [2022-04-28 15:16:06,034 INFO L226 Difference]: Without dead ends: 393 [2022-04-28 15:16:06,035 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-28 15:16:06,035 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:06,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:16:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-28 15:16:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 386. [2022-04-28 15:16:06,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:06,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 386 states, 381 states have (on average 1.5091863517060367) internal successors, (575), 381 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,069 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 386 states, 381 states have (on average 1.5091863517060367) internal successors, (575), 381 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,069 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 386 states, 381 states have (on average 1.5091863517060367) internal successors, (575), 381 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:06,076 INFO L93 Difference]: Finished difference Result 393 states and 589 transitions. [2022-04-28 15:16:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 589 transitions. [2022-04-28 15:16:06,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:06,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:06,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 381 states have (on average 1.5091863517060367) internal successors, (575), 381 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-28 15:16:06,078 INFO L87 Difference]: Start difference. First operand has 386 states, 381 states have (on average 1.5091863517060367) internal successors, (575), 381 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-28 15:16:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:06,086 INFO L93 Difference]: Finished difference Result 393 states and 589 transitions. [2022-04-28 15:16:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 589 transitions. [2022-04-28 15:16:06,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:06,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:06,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:06,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 381 states have (on average 1.5091863517060367) internal successors, (575), 381 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 579 transitions. [2022-04-28 15:16:06,096 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 579 transitions. Word has length 115 [2022-04-28 15:16:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:06,097 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 579 transitions. [2022-04-28 15:16:06,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 386 states and 579 transitions. [2022-04-28 15:16:06,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 579 edges. 579 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 579 transitions. [2022-04-28 15:16:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 15:16:06,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:06,573 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:06,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:16:06,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1965336058, now seen corresponding path program 1 times [2022-04-28 15:16:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:06,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703121991] [2022-04-28 15:16:06,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1965336058, now seen corresponding path program 2 times [2022-04-28 15:16:06,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:06,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694129287] [2022-04-28 15:16:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:06,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {33686#(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(196, 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); {33680#true} is VALID [2022-04-28 15:16:06,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {33680#true} assume true; {33680#true} is VALID [2022-04-28 15:16:06,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33680#true} {33680#true} #592#return; {33680#true} is VALID [2022-04-28 15:16:06,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {33680#true} call ULTIMATE.init(); {33686#(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-28 15:16:06,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {33686#(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(196, 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); {33680#true} is VALID [2022-04-28 15:16:06,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {33680#true} assume true; {33680#true} is VALID [2022-04-28 15:16:06,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33680#true} {33680#true} #592#return; {33680#true} is VALID [2022-04-28 15:16:06,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {33680#true} call #t~ret159 := main(); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {33680#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {33680#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {33680#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {33680#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {33680#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {33680#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {33680#true} assume !false; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {33680#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {33680#true} assume 12292 == #t~mem43;havoc #t~mem43; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {33680#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {33680#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {33680#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {33680#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {33680#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {33680#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {33680#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {33680#true} is VALID [2022-04-28 15:16:06,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {33680#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {33680#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {33680#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {33680#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {33680#true} ~skip~0 := 0; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {33680#true} assume !false; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {33680#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {33680#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {33680#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {33680#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {33680#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {33680#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {33680#true} assume 4368 == #t~mem48;havoc #t~mem48; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {33680#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {33680#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {33680#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {33680#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {33680#true} is VALID [2022-04-28 15:16:06,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {33680#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {33680#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {33680#true} ~skip~0 := 0; {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {33680#true} assume !false; {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {33680#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {33680#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {33680#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {33680#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {33680#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {33680#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {33680#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {33680#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {33680#true} assume 4384 == #t~mem50;havoc #t~mem50; {33680#true} is VALID [2022-04-28 15:16:06,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {33680#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {33680#true} is VALID [2022-04-28 15:16:06,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {33680#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,730 INFO L290 TraceCheckUtils]: 81: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,730 INFO L290 TraceCheckUtils]: 82: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume 4512 == #t~mem68;havoc #t~mem68; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,733 INFO L290 TraceCheckUtils]: 91: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,733 INFO L290 TraceCheckUtils]: 92: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == ~tmp___8~0); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,733 INFO L290 TraceCheckUtils]: 93: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,734 INFO L290 TraceCheckUtils]: 96: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,734 INFO L290 TraceCheckUtils]: 97: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,734 INFO L290 TraceCheckUtils]: 98: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,734 INFO L290 TraceCheckUtils]: 99: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,735 INFO L290 TraceCheckUtils]: 103: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,736 INFO L290 TraceCheckUtils]: 104: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,736 INFO L290 TraceCheckUtils]: 105: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,736 INFO L290 TraceCheckUtils]: 106: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,736 INFO L290 TraceCheckUtils]: 107: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,736 INFO L290 TraceCheckUtils]: 108: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,737 INFO L290 TraceCheckUtils]: 109: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,737 INFO L290 TraceCheckUtils]: 110: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,737 INFO L290 TraceCheckUtils]: 111: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,737 INFO L290 TraceCheckUtils]: 112: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {33685#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:06,738 INFO L290 TraceCheckUtils]: 113: Hoare triple {33685#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {33681#false} is VALID [2022-04-28 15:16:06,738 INFO L290 TraceCheckUtils]: 114: Hoare triple {33681#false} assume !false; {33681#false} is VALID [2022-04-28 15:16:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 15:16:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:06,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694129287] [2022-04-28 15:16:06,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694129287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:06,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:06,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:06,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:06,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703121991] [2022-04-28 15:16:06,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703121991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:06,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:06,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652527053] [2022-04-28 15:16:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:06,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:16:06,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:06,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:06,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:16:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:16:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:16:06,852 INFO L87 Difference]: Start difference. First operand 386 states and 579 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:08,873 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-28 15:16:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:09,744 INFO L93 Difference]: Finished difference Result 775 states and 1171 transitions. [2022-04-28 15:16:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:09,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:16:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 15:16:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-28 15:16:09,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-28 15:16:10,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:10,062 INFO L225 Difference]: With dead ends: 775 [2022-04-28 15:16:10,063 INFO L226 Difference]: Without dead ends: 579 [2022-04-28 15:16:10,063 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-28 15:16:10,064 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 109 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:10,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-04-28 15:16:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2022-04-28 15:16:10,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:10,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 579 states. Second operand has 579 states, 574 states have (on average 1.505226480836237) internal successors, (864), 574 states have internal predecessors, (864), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:10,093 INFO L74 IsIncluded]: Start isIncluded. First operand 579 states. Second operand has 579 states, 574 states have (on average 1.505226480836237) internal successors, (864), 574 states have internal predecessors, (864), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:10,094 INFO L87 Difference]: Start difference. First operand 579 states. Second operand has 579 states, 574 states have (on average 1.505226480836237) internal successors, (864), 574 states have internal predecessors, (864), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:10,105 INFO L93 Difference]: Finished difference Result 579 states and 868 transitions. [2022-04-28 15:16:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 868 transitions. [2022-04-28 15:16:10,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:10,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:10,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 579 states, 574 states have (on average 1.505226480836237) internal successors, (864), 574 states have internal predecessors, (864), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-28 15:16:10,106 INFO L87 Difference]: Start difference. First operand has 579 states, 574 states have (on average 1.505226480836237) internal successors, (864), 574 states have internal predecessors, (864), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-28 15:16:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:10,122 INFO L93 Difference]: Finished difference Result 579 states and 868 transitions. [2022-04-28 15:16:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 868 transitions. [2022-04-28 15:16:10,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:10,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:10,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:10,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.505226480836237) internal successors, (864), 574 states have internal predecessors, (864), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 868 transitions. [2022-04-28 15:16:10,148 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 868 transitions. Word has length 115 [2022-04-28 15:16:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:10,148 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 868 transitions. [2022-04-28 15:16:10,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:10,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 579 states and 868 transitions. [2022-04-28 15:16:10,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 868 edges. 868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 868 transitions. [2022-04-28 15:16:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 15:16:10,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:10,811 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:10,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:16:10,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1912234632, now seen corresponding path program 1 times [2022-04-28 15:16:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091462328] [2022-04-28 15:16:10,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1912234632, now seen corresponding path program 2 times [2022-04-28 15:16:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77227231] [2022-04-28 15:16:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:10,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {37561#(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(196, 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); {37555#true} is VALID [2022-04-28 15:16:10,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {37555#true} assume true; {37555#true} is VALID [2022-04-28 15:16:10,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37555#true} {37555#true} #592#return; {37555#true} is VALID [2022-04-28 15:16:10,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {37555#true} call ULTIMATE.init(); {37561#(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-28 15:16:10,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {37561#(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(196, 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); {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {37555#true} assume true; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37555#true} {37555#true} #592#return; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {37555#true} call #t~ret159 := main(); {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {37555#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {37555#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {37555#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {37555#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {37555#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {37555#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {37555#true} assume !false; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {37555#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {37555#true} assume 12292 == #t~mem43;havoc #t~mem43; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {37555#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {37555#true} is VALID [2022-04-28 15:16:10,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {37555#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {37555#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {37555#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {37555#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {37555#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {37555#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {37555#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {37555#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {37555#true} ~skip~0 := 0; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {37555#true} assume !false; {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {37555#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {37555#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {37555#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {37555#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {37555#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {37555#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37555#true} is VALID [2022-04-28 15:16:10,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {37555#true} assume 4368 == #t~mem48;havoc #t~mem48; {37555#true} is VALID [2022-04-28 15:16:10,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {37555#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {37555#true} is VALID [2022-04-28 15:16:10,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {37555#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !false; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,937 INFO L290 TraceCheckUtils]: 47: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {37560#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:16:10,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {37560#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {37556#false} is VALID [2022-04-28 15:16:10,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {37556#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {37556#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {37556#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {37556#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {37556#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {37556#false} ~skip~0 := 0; {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {37556#false} assume !false; {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {37556#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {37556#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {37556#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {37556#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {37556#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {37556#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {37556#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {37556#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {37556#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {37556#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {37556#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {37556#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {37556#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 73: Hoare triple {37556#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {37556#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 75: Hoare triple {37556#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {37556#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {37556#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {37556#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {37556#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 80: Hoare triple {37556#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,943 INFO L290 TraceCheckUtils]: 81: Hoare triple {37556#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {37556#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 83: Hoare triple {37556#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 84: Hoare triple {37556#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 85: Hoare triple {37556#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 86: Hoare triple {37556#false} assume 4512 == #t~mem68;havoc #t~mem68; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 87: Hoare triple {37556#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 88: Hoare triple {37556#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {37556#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 90: Hoare triple {37556#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 91: Hoare triple {37556#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {37556#false} assume !(0 == ~tmp___8~0); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {37556#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {37556#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {37556#false} ~skip~0 := 0; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {37556#false} assume !false; {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {37556#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {37556#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,944 INFO L290 TraceCheckUtils]: 99: Hoare triple {37556#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 100: Hoare triple {37556#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 101: Hoare triple {37556#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 102: Hoare triple {37556#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 103: Hoare triple {37556#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 104: Hoare triple {37556#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {37556#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {37556#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 107: Hoare triple {37556#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 108: Hoare triple {37556#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 109: Hoare triple {37556#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 110: Hoare triple {37556#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 111: Hoare triple {37556#false} assume 4432 == #t~mem56;havoc #t~mem56; {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 112: Hoare triple {37556#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 113: Hoare triple {37556#false} assume 5 == ~blastFlag~0; {37556#false} is VALID [2022-04-28 15:16:10,945 INFO L290 TraceCheckUtils]: 114: Hoare triple {37556#false} assume !false; {37556#false} is VALID [2022-04-28 15:16:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 15:16:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77227231] [2022-04-28 15:16:10,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77227231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:10,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:10,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:10,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091462328] [2022-04-28 15:16:10,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091462328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:10,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:10,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818563005] [2022-04-28 15:16:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:16:10,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:10,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:11,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:11,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:16:11,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:16:11,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:16:11,016 INFO L87 Difference]: Start difference. First operand 579 states and 868 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,033 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-28 15:16:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:13,637 INFO L93 Difference]: Finished difference Result 992 states and 1488 transitions. [2022-04-28 15:16:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-28 15:16:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-28 15:16:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-28 15:16:13,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-28 15:16:13,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:13,876 INFO L225 Difference]: With dead ends: 992 [2022-04-28 15:16:13,876 INFO L226 Difference]: Without dead ends: 603 [2022-04-28 15:16:13,877 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-28 15:16:13,877 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:13,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:16:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-28 15:16:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2022-04-28 15:16:13,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:13,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 603 states, 598 states have (on average 1.4983277591973243) internal successors, (896), 598 states have internal predecessors, (896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,900 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 603 states, 598 states have (on average 1.4983277591973243) internal successors, (896), 598 states have internal predecessors, (896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,900 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 603 states, 598 states have (on average 1.4983277591973243) internal successors, (896), 598 states have internal predecessors, (896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:13,911 INFO L93 Difference]: Finished difference Result 603 states and 900 transitions. [2022-04-28 15:16:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 900 transitions. [2022-04-28 15:16:13,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:13,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:13,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 603 states, 598 states have (on average 1.4983277591973243) internal successors, (896), 598 states have internal predecessors, (896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-28 15:16:13,913 INFO L87 Difference]: Start difference. First operand has 603 states, 598 states have (on average 1.4983277591973243) internal successors, (896), 598 states have internal predecessors, (896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-28 15:16:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:13,924 INFO L93 Difference]: Finished difference Result 603 states and 900 transitions. [2022-04-28 15:16:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 900 transitions. [2022-04-28 15:16:13,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:13,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:13,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:13,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 598 states have (on average 1.4983277591973243) internal successors, (896), 598 states have internal predecessors, (896), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 900 transitions. [2022-04-28 15:16:13,941 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 900 transitions. Word has length 115 [2022-04-28 15:16:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:13,941 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 900 transitions. [2022-04-28 15:16:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:13,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 603 states and 900 transitions. [2022-04-28 15:16:14,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 900 edges. 900 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 900 transitions. [2022-04-28 15:16:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 15:16:14,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:14,651 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, 1] [2022-04-28 15:16:14,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:16:14,651 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:14,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 1 times [2022-04-28 15:16:14,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:14,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1606380251] [2022-04-28 15:16:14,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 2 times [2022-04-28 15:16:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733984966] [2022-04-28 15:16:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:14,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:14,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {41966#(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(196, 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); {41960#true} is VALID [2022-04-28 15:16:14,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {41960#true} assume true; {41960#true} is VALID [2022-04-28 15:16:14,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41960#true} {41960#true} #592#return; {41960#true} is VALID [2022-04-28 15:16:14,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {41960#true} call ULTIMATE.init(); {41966#(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-28 15:16:14,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {41966#(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(196, 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); {41960#true} is VALID [2022-04-28 15:16:14,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {41960#true} assume true; {41960#true} is VALID [2022-04-28 15:16:14,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41960#true} {41960#true} #592#return; {41960#true} is VALID [2022-04-28 15:16:14,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {41960#true} call #t~ret159 := main(); {41960#true} is VALID [2022-04-28 15:16:14,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {41960#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {41960#true} is VALID [2022-04-28 15:16:14,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {41960#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {41960#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {41960#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {41960#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {41960#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {41960#true} assume !false; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {41960#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {41960#true} assume 12292 == #t~mem43;havoc #t~mem43; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {41960#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {41960#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {41960#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {41960#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {41960#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {41960#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {41960#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {41960#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {41960#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {41960#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {41960#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41960#true} is VALID [2022-04-28 15:16:14,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {41960#true} ~skip~0 := 0; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {41960#true} assume !false; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {41960#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {41960#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {41960#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {41960#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {41960#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {41960#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {41960#true} assume 4368 == #t~mem48;havoc #t~mem48; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {41960#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {41960#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {41960#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {41960#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {41960#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {41960#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {41960#true} ~skip~0 := 0; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {41960#true} assume !false; {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {41960#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {41960#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {41960#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {41960#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {41960#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {41960#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {41960#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {41960#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {41960#true} assume 4384 == #t~mem50;havoc #t~mem50; {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {41960#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {41960#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {41960#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {41960#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {41960#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {41960#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 57: Hoare triple {41960#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {41960#true} ~skip~0 := 0; {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 59: Hoare triple {41960#true} assume !false; {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {41960#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {41960#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {41960#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {41960#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {41960#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 65: Hoare triple {41960#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {41960#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {41960#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {41960#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {41960#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {41960#true} assume 4400 == #t~mem52;havoc #t~mem52; {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 71: Hoare triple {41960#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {41960#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {41960#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {41960#true} assume !(~ret~0 <= 0); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {41960#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {41960#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {41960#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41960#true} is VALID [2022-04-28 15:16:14,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {41960#true} ~skip~0 := 0; {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {41960#true} assume !false; {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {41960#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {41960#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {41960#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {41960#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {41960#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {41960#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {41960#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {41960#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {41960#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {41960#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 90: Hoare triple {41960#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 91: Hoare triple {41960#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {41960#true} assume 4416 == #t~mem54;havoc #t~mem54; {41960#true} is VALID [2022-04-28 15:16:14,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {41960#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {41960#true} is VALID [2022-04-28 15:16:14,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {41960#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !false; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,796 INFO L290 TraceCheckUtils]: 102: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,797 INFO L290 TraceCheckUtils]: 103: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,797 INFO L290 TraceCheckUtils]: 104: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,798 INFO L290 TraceCheckUtils]: 107: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,798 INFO L290 TraceCheckUtils]: 108: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,798 INFO L290 TraceCheckUtils]: 109: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,798 INFO L290 TraceCheckUtils]: 110: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,798 INFO L290 TraceCheckUtils]: 111: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,799 INFO L290 TraceCheckUtils]: 112: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,799 INFO L290 TraceCheckUtils]: 113: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,799 INFO L290 TraceCheckUtils]: 114: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,799 INFO L290 TraceCheckUtils]: 115: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,799 INFO L290 TraceCheckUtils]: 116: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {41965#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:14,800 INFO L290 TraceCheckUtils]: 117: Hoare triple {41965#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {41961#false} is VALID [2022-04-28 15:16:14,800 INFO L290 TraceCheckUtils]: 118: Hoare triple {41961#false} assume !false; {41961#false} is VALID [2022-04-28 15:16:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 15:16:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:14,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733984966] [2022-04-28 15:16:14,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733984966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:14,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:14,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:14,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:14,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1606380251] [2022-04-28 15:16:14,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1606380251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:14,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:14,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:14,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110269727] [2022-04-28 15:16:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 15:16:14,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:14,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:14,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:14,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:16:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:16:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:16:14,855 INFO L87 Difference]: Start difference. First operand 603 states and 900 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:16,877 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-28 15:16:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:17,778 INFO L93 Difference]: Finished difference Result 1207 states and 1810 transitions. [2022-04-28 15:16:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 15:16:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 15:16:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-28 15:16:17,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-28 15:16:18,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:18,104 INFO L225 Difference]: With dead ends: 1207 [2022-04-28 15:16:18,105 INFO L226 Difference]: Without dead ends: 794 [2022-04-28 15:16:18,105 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-28 15:16:18,105 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:18,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 481 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-04-28 15:16:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2022-04-28 15:16:18,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:18,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand has 794 states, 789 states have (on average 1.4980988593155893) internal successors, (1182), 789 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand has 794 states, 789 states have (on average 1.4980988593155893) internal successors, (1182), 789 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:18,134 INFO L87 Difference]: Start difference. First operand 794 states. Second operand has 794 states, 789 states have (on average 1.4980988593155893) internal successors, (1182), 789 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:18,153 INFO L93 Difference]: Finished difference Result 794 states and 1186 transitions. [2022-04-28 15:16:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1186 transitions. [2022-04-28 15:16:18,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:18,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:18,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 794 states, 789 states have (on average 1.4980988593155893) internal successors, (1182), 789 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 794 states. [2022-04-28 15:16:18,156 INFO L87 Difference]: Start difference. First operand has 794 states, 789 states have (on average 1.4980988593155893) internal successors, (1182), 789 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 794 states. [2022-04-28 15:16:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:18,176 INFO L93 Difference]: Finished difference Result 794 states and 1186 transitions. [2022-04-28 15:16:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1186 transitions. [2022-04-28 15:16:18,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:18,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:18,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:18,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 789 states have (on average 1.4980988593155893) internal successors, (1182), 789 states have internal predecessors, (1182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1186 transitions. [2022-04-28 15:16:18,203 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1186 transitions. Word has length 119 [2022-04-28 15:16:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:18,203 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1186 transitions. [2022-04-28 15:16:18,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:18,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 794 states and 1186 transitions. [2022-04-28 15:16:19,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1186 edges. 1186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1186 transitions. [2022-04-28 15:16:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 15:16:19,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:19,116 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, 1] [2022-04-28 15:16:19,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:16:19,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1760361152, now seen corresponding path program 1 times [2022-04-28 15:16:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964344485] [2022-04-28 15:16:19,117 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1760361152, now seen corresponding path program 2 times [2022-04-28 15:16:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:19,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517719319] [2022-04-28 15:16:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:19,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {47565#(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(196, 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); {47559#true} is VALID [2022-04-28 15:16:19,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {47559#true} assume true; {47559#true} is VALID [2022-04-28 15:16:19,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47559#true} {47559#true} #592#return; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {47559#true} call ULTIMATE.init(); {47565#(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-28 15:16:19,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {47565#(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(196, 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); {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {47559#true} assume true; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47559#true} {47559#true} #592#return; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {47559#true} call #t~ret159 := main(); {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {47559#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {47559#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {47559#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {47559#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {47559#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {47559#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {47559#true} assume !false; {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {47559#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {47559#true} assume 12292 == #t~mem43;havoc #t~mem43; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {47559#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {47559#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {47559#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {47559#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {47559#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {47559#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {47559#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {47559#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {47559#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {47559#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {47559#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {47559#true} ~skip~0 := 0; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {47559#true} assume !false; {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {47559#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {47559#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {47559#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {47559#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {47559#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {47559#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {47559#true} assume 4368 == #t~mem48;havoc #t~mem48; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {47559#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {47559#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {47559#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {47559#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {47559#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {47559#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {47559#true} ~skip~0 := 0; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {47559#true} assume !false; {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {47559#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {47559#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {47559#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {47559#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {47559#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {47559#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {47559#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {47559#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {47559#true} assume 4384 == #t~mem50;havoc #t~mem50; {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {47559#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {47559#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {47559#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {47559#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {47559#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {47559#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {47559#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {47559#true} ~skip~0 := 0; {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {47559#true} assume !false; {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {47559#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {47559#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {47559#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 63: Hoare triple {47559#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {47559#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {47559#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {47559#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {47559#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {47559#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {47559#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47559#true} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {47559#true} assume 4400 == #t~mem52;havoc #t~mem52; {47559#true} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {47559#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {47559#true} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {47559#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47559#true} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {47559#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,250 INFO L290 TraceCheckUtils]: 75: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,250 INFO L290 TraceCheckUtils]: 76: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,250 INFO L290 TraceCheckUtils]: 79: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,251 INFO L290 TraceCheckUtils]: 83: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,251 INFO L290 TraceCheckUtils]: 84: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,252 INFO L290 TraceCheckUtils]: 87: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,252 INFO L290 TraceCheckUtils]: 88: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,253 INFO L290 TraceCheckUtils]: 90: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,253 INFO L290 TraceCheckUtils]: 91: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,253 INFO L290 TraceCheckUtils]: 92: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem54;havoc #t~mem54; {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,253 INFO L290 TraceCheckUtils]: 93: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {47564#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 94: Hoare triple {47564#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 95: Hoare triple {47560#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 96: Hoare triple {47560#false} assume !(0 == ~tmp___6~0); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {47560#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {47560#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 99: Hoare triple {47560#false} ~skip~0 := 0; {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 100: Hoare triple {47560#false} assume !false; {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {47560#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {47560#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 103: Hoare triple {47560#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 104: Hoare triple {47560#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {47560#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {47560#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {47560#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 108: Hoare triple {47560#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 109: Hoare triple {47560#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 110: Hoare triple {47560#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 111: Hoare triple {47560#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 112: Hoare triple {47560#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 113: Hoare triple {47560#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {47560#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 115: Hoare triple {47560#false} assume 4432 == #t~mem56;havoc #t~mem56; {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 116: Hoare triple {47560#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 117: Hoare triple {47560#false} assume 5 == ~blastFlag~0; {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L290 TraceCheckUtils]: 118: Hoare triple {47560#false} assume !false; {47560#false} is VALID [2022-04-28 15:16:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 15:16:19,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:19,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517719319] [2022-04-28 15:16:19,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517719319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:19,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:19,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:19,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:19,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964344485] [2022-04-28 15:16:19,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964344485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:19,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:19,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135218203] [2022-04-28 15:16:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:19,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 15:16:19,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:19,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:19,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:16:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:19,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:16:19,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:16:19,315 INFO L87 Difference]: Start difference. First operand 794 states and 1186 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:21,330 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-28 15:16:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:22,285 INFO L93 Difference]: Finished difference Result 1566 states and 2346 transitions. [2022-04-28 15:16:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 15:16:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-28 15:16:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-28 15:16:22,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-28 15:16:22,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:22,616 INFO L225 Difference]: With dead ends: 1566 [2022-04-28 15:16:22,616 INFO L226 Difference]: Without dead ends: 962 [2022-04-28 15:16:22,617 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-28 15:16:22,617 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 130 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:22,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-04-28 15:16:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-04-28 15:16:22,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:22,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 962 states. Second operand has 962 states, 957 states have (on average 1.4963427377220482) internal successors, (1432), 957 states have internal predecessors, (1432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,659 INFO L74 IsIncluded]: Start isIncluded. First operand 962 states. Second operand has 962 states, 957 states have (on average 1.4963427377220482) internal successors, (1432), 957 states have internal predecessors, (1432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,660 INFO L87 Difference]: Start difference. First operand 962 states. Second operand has 962 states, 957 states have (on average 1.4963427377220482) internal successors, (1432), 957 states have internal predecessors, (1432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:22,685 INFO L93 Difference]: Finished difference Result 962 states and 1436 transitions. [2022-04-28 15:16:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1436 transitions. [2022-04-28 15:16:22,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:22,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:22,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 962 states, 957 states have (on average 1.4963427377220482) internal successors, (1432), 957 states have internal predecessors, (1432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 962 states. [2022-04-28 15:16:22,688 INFO L87 Difference]: Start difference. First operand has 962 states, 957 states have (on average 1.4963427377220482) internal successors, (1432), 957 states have internal predecessors, (1432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 962 states. [2022-04-28 15:16:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:22,712 INFO L93 Difference]: Finished difference Result 962 states and 1436 transitions. [2022-04-28 15:16:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1436 transitions. [2022-04-28 15:16:22,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:22,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:22,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:22,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 957 states have (on average 1.4963427377220482) internal successors, (1432), 957 states have internal predecessors, (1432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1436 transitions. [2022-04-28 15:16:22,750 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1436 transitions. Word has length 119 [2022-04-28 15:16:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:22,750 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1436 transitions. [2022-04-28 15:16:22,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 962 states and 1436 transitions. [2022-04-28 15:16:23,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1436 edges. 1436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1436 transitions. [2022-04-28 15:16:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-28 15:16:23,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:23,813 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:23,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:16:23,814 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1017598080, now seen corresponding path program 1 times [2022-04-28 15:16:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:23,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273049995] [2022-04-28 15:16:23,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1017598080, now seen corresponding path program 2 times [2022-04-28 15:16:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:23,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764425993] [2022-04-28 15:16:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:23,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {54555#(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(196, 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); {54548#true} is VALID [2022-04-28 15:16:23,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {54548#true} assume true; {54548#true} is VALID [2022-04-28 15:16:23,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54548#true} {54548#true} #592#return; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {54548#true} call ULTIMATE.init(); {54555#(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-28 15:16:23,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {54555#(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(196, 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); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {54548#true} assume true; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54548#true} {54548#true} #592#return; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {54548#true} call #t~ret159 := main(); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {54548#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {54548#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {54548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {54548#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {54548#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {54548#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {54548#true} assume !false; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {54548#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {54548#true} assume 12292 == #t~mem43;havoc #t~mem43; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {54548#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {54548#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {54548#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {54548#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {54548#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {54548#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {54548#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {54548#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {54548#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {54548#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {54548#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {54548#true} ~skip~0 := 0; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {54548#true} assume !false; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {54548#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {54548#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {54548#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {54548#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {54548#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {54548#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {54548#true} assume 4368 == #t~mem48;havoc #t~mem48; {54548#true} is VALID [2022-04-28 15:16:23,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {54548#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {54548#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {54548#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {54548#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {54548#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {54548#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {54548#true} ~skip~0 := 0; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {54548#true} assume !false; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {54548#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {54548#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {54548#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {54548#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {54548#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {54548#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {54548#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {54548#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {54548#true} assume 4384 == #t~mem50;havoc #t~mem50; {54548#true} is VALID [2022-04-28 15:16:23,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {54548#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {54548#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {54548#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {54548#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {54548#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {54548#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {54548#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 58: Hoare triple {54548#true} ~skip~0 := 0; {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {54548#true} assume !false; {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {54548#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {54548#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 62: Hoare triple {54548#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 63: Hoare triple {54548#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 64: Hoare triple {54548#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {54548#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {54548#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {54548#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {54548#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {54548#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 70: Hoare triple {54548#true} assume 4400 == #t~mem52;havoc #t~mem52; {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 71: Hoare triple {54548#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {54548#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {54548#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 74: Hoare triple {54548#true} assume !(~ret~0 <= 0); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 75: Hoare triple {54548#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 76: Hoare triple {54548#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {54548#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {54548#true} ~skip~0 := 0; {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 79: Hoare triple {54548#true} assume !false; {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 80: Hoare triple {54548#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {54548#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 82: Hoare triple {54548#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 83: Hoare triple {54548#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 84: Hoare triple {54548#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 85: Hoare triple {54548#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {54548#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 87: Hoare triple {54548#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,997 INFO L290 TraceCheckUtils]: 88: Hoare triple {54548#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,998 INFO L290 TraceCheckUtils]: 89: Hoare triple {54548#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {54548#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,998 INFO L290 TraceCheckUtils]: 91: Hoare triple {54548#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54548#true} is VALID [2022-04-28 15:16:23,998 INFO L290 TraceCheckUtils]: 92: Hoare triple {54548#true} assume 4416 == #t~mem54;havoc #t~mem54; {54548#true} is VALID [2022-04-28 15:16:23,998 INFO L290 TraceCheckUtils]: 93: Hoare triple {54548#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {54548#true} is VALID [2022-04-28 15:16:23,998 INFO L290 TraceCheckUtils]: 94: Hoare triple {54548#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {54548#true} is VALID [2022-04-28 15:16:23,999 INFO L290 TraceCheckUtils]: 95: Hoare triple {54548#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:23,999 INFO L290 TraceCheckUtils]: 96: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:23,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,000 INFO L290 TraceCheckUtils]: 98: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,000 INFO L290 TraceCheckUtils]: 99: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,000 INFO L290 TraceCheckUtils]: 100: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,001 INFO L290 TraceCheckUtils]: 102: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,001 INFO L290 TraceCheckUtils]: 103: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,001 INFO L290 TraceCheckUtils]: 104: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,002 INFO L290 TraceCheckUtils]: 105: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,002 INFO L290 TraceCheckUtils]: 106: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,002 INFO L290 TraceCheckUtils]: 107: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,002 INFO L290 TraceCheckUtils]: 108: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,003 INFO L290 TraceCheckUtils]: 109: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,003 INFO L290 TraceCheckUtils]: 110: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,003 INFO L290 TraceCheckUtils]: 111: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,004 INFO L290 TraceCheckUtils]: 112: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,004 INFO L290 TraceCheckUtils]: 113: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:16:24,004 INFO L290 TraceCheckUtils]: 114: Hoare triple {54553#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54554#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-28 15:16:24,004 INFO L290 TraceCheckUtils]: 115: Hoare triple {54554#(= |ssl3_connect_#t~mem56| 4432)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,004 INFO L290 TraceCheckUtils]: 116: Hoare triple {54549#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 117: Hoare triple {54549#false} assume 4448 == #t~mem58;havoc #t~mem58; {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 118: Hoare triple {54549#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 119: Hoare triple {54549#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 120: Hoare triple {54549#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 121: Hoare triple {54549#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 122: Hoare triple {54549#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 123: Hoare triple {54549#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 124: Hoare triple {54549#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54549#false} is VALID [2022-04-28 15:16:24,005 INFO L290 TraceCheckUtils]: 125: Hoare triple {54549#false} ~skip~0 := 0; {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 126: Hoare triple {54549#false} assume !false; {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 127: Hoare triple {54549#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 128: Hoare triple {54549#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 129: Hoare triple {54549#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 130: Hoare triple {54549#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 131: Hoare triple {54549#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 132: Hoare triple {54549#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 133: Hoare triple {54549#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 134: Hoare triple {54549#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 135: Hoare triple {54549#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 136: Hoare triple {54549#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 137: Hoare triple {54549#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 138: Hoare triple {54549#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 139: Hoare triple {54549#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 140: Hoare triple {54549#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 141: Hoare triple {54549#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 142: Hoare triple {54549#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 143: Hoare triple {54549#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,006 INFO L290 TraceCheckUtils]: 144: Hoare triple {54549#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 145: Hoare triple {54549#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 146: Hoare triple {54549#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 147: Hoare triple {54549#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 148: Hoare triple {54549#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 149: Hoare triple {54549#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 150: Hoare triple {54549#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 151: Hoare triple {54549#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 152: Hoare triple {54549#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 153: Hoare triple {54549#false} assume 4512 == #t~mem68;havoc #t~mem68; {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 154: Hoare triple {54549#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 155: Hoare triple {54549#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 156: Hoare triple {54549#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 157: Hoare triple {54549#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 158: Hoare triple {54549#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 159: Hoare triple {54549#false} assume !(0 == ~tmp___8~0); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 160: Hoare triple {54549#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 161: Hoare triple {54549#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54549#false} is VALID [2022-04-28 15:16:24,007 INFO L290 TraceCheckUtils]: 162: Hoare triple {54549#false} ~skip~0 := 0; {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 163: Hoare triple {54549#false} assume !false; {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 164: Hoare triple {54549#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 165: Hoare triple {54549#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 166: Hoare triple {54549#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 167: Hoare triple {54549#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 168: Hoare triple {54549#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 169: Hoare triple {54549#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 170: Hoare triple {54549#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 171: Hoare triple {54549#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 172: Hoare triple {54549#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 173: Hoare triple {54549#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 174: Hoare triple {54549#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 175: Hoare triple {54549#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 176: Hoare triple {54549#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 177: Hoare triple {54549#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 178: Hoare triple {54549#false} assume 4432 == #t~mem56;havoc #t~mem56; {54549#false} is VALID [2022-04-28 15:16:24,008 INFO L290 TraceCheckUtils]: 179: Hoare triple {54549#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {54549#false} is VALID [2022-04-28 15:16:24,009 INFO L290 TraceCheckUtils]: 180: Hoare triple {54549#false} assume 5 == ~blastFlag~0; {54549#false} is VALID [2022-04-28 15:16:24,009 INFO L290 TraceCheckUtils]: 181: Hoare triple {54549#false} assume !false; {54549#false} is VALID [2022-04-28 15:16:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-04-28 15:16:24,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:24,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764425993] [2022-04-28 15:16:24,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764425993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:24,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:24,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:24,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:24,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273049995] [2022-04-28 15:16:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273049995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:24,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:24,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292980909] [2022-04-28 15:16:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 182 [2022-04-28 15:16:24,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:24,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:24,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:24,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:24,089 INFO L87 Difference]: Start difference. First operand 962 states and 1436 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:26,110 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-28 15:16:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:27,252 INFO L93 Difference]: Finished difference Result 2011 states and 2974 transitions. [2022-04-28 15:16:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:27,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 182 [2022-04-28 15:16:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2022-04-28 15:16:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2022-04-28 15:16:27,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 409 transitions. [2022-04-28 15:16:27,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:27,543 INFO L225 Difference]: With dead ends: 2011 [2022-04-28 15:16:27,543 INFO L226 Difference]: Without dead ends: 1065 [2022-04-28 15:16:27,544 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-28 15:16:27,545 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 41 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:27,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 515 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2022-04-28 15:16:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 962. [2022-04-28 15:16:27,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:27,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1065 states. Second operand has 962 states, 957 states have (on average 1.4921630094043887) internal successors, (1428), 957 states have internal predecessors, (1428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,577 INFO L74 IsIncluded]: Start isIncluded. First operand 1065 states. Second operand has 962 states, 957 states have (on average 1.4921630094043887) internal successors, (1428), 957 states have internal predecessors, (1428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,578 INFO L87 Difference]: Start difference. First operand 1065 states. Second operand has 962 states, 957 states have (on average 1.4921630094043887) internal successors, (1428), 957 states have internal predecessors, (1428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:27,607 INFO L93 Difference]: Finished difference Result 1065 states and 1554 transitions. [2022-04-28 15:16:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1554 transitions. [2022-04-28 15:16:27,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:27,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:27,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 962 states, 957 states have (on average 1.4921630094043887) internal successors, (1428), 957 states have internal predecessors, (1428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1065 states. [2022-04-28 15:16:27,610 INFO L87 Difference]: Start difference. First operand has 962 states, 957 states have (on average 1.4921630094043887) internal successors, (1428), 957 states have internal predecessors, (1428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1065 states. [2022-04-28 15:16:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:27,639 INFO L93 Difference]: Finished difference Result 1065 states and 1554 transitions. [2022-04-28 15:16:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1554 transitions. [2022-04-28 15:16:27,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:27,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:27,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:27,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 957 states have (on average 1.4921630094043887) internal successors, (1428), 957 states have internal predecessors, (1428), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1432 transitions. [2022-04-28 15:16:27,677 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1432 transitions. Word has length 182 [2022-04-28 15:16:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:27,677 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1432 transitions. [2022-04-28 15:16:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 962 states and 1432 transitions. [2022-04-28 15:16:28,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1432 edges. 1432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1432 transitions. [2022-04-28 15:16:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-28 15:16:28,776 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:28,776 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:16:28,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:16:28,776 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -874581490, now seen corresponding path program 3 times [2022-04-28 15:16:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:28,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616439875] [2022-04-28 15:16:54,572 WARN L232 SmtUtils]: Spent 22.85s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:17:03,039 WARN L232 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:17:05,024 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -874581490, now seen corresponding path program 4 times [2022-04-28 15:17:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956633547] [2022-04-28 15:17:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:05,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {62643#(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(196, 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); {62636#true} is VALID [2022-04-28 15:17:05,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {62636#true} assume true; {62636#true} is VALID [2022-04-28 15:17:05,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62636#true} {62636#true} #592#return; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {62636#true} call ULTIMATE.init(); {62643#(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-28 15:17:05,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {62643#(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(196, 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); {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {62636#true} assume true; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62636#true} {62636#true} #592#return; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {62636#true} call #t~ret159 := main(); {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {62636#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {62636#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {62636#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {62636#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {62636#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {62636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {62636#true} assume !false; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {62636#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {62636#true} assume 12292 == #t~mem43;havoc #t~mem43; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {62636#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {62636#true} is VALID [2022-04-28 15:17:05,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {62636#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {62636#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {62636#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {62636#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {62636#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {62636#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {62636#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {62636#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {62636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {62636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {62636#true} ~skip~0 := 0; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {62636#true} assume !false; {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {62636#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {62636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {62636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {62636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {62636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {62636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {62636#true} assume 4368 == #t~mem48;havoc #t~mem48; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {62636#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {62636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {62636#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {62636#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {62636#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {62636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {62636#true} ~skip~0 := 0; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {62636#true} assume !false; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {62636#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {62636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {62636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {62636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {62636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {62636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {62636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {62636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {62636#true} assume 4384 == #t~mem50;havoc #t~mem50; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {62636#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {62636#true} is VALID [2022-04-28 15:17:05,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {62636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62636#true} is VALID [2022-04-28 15:17:05,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {62636#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {62636#true} is VALID [2022-04-28 15:17:05,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {62636#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {62641#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62642#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {62642#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {62637#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {62637#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {62637#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {62637#false} assume !(~ret~0 <= 0); {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {62637#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {62637#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {62637#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {62637#false} ~skip~0 := 0; {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 79: Hoare triple {62637#false} assume !false; {62637#false} is VALID [2022-04-28 15:17:05,217 INFO L290 TraceCheckUtils]: 80: Hoare triple {62637#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 81: Hoare triple {62637#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 82: Hoare triple {62637#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 83: Hoare triple {62637#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {62637#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {62637#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {62637#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {62637#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 88: Hoare triple {62637#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 89: Hoare triple {62637#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 90: Hoare triple {62637#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {62637#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 92: Hoare triple {62637#false} assume 4416 == #t~mem54;havoc #t~mem54; {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 93: Hoare triple {62637#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 94: Hoare triple {62637#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 95: Hoare triple {62637#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 96: Hoare triple {62637#false} assume !(0 == ~tmp___6~0); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 97: Hoare triple {62637#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,218 INFO L290 TraceCheckUtils]: 98: Hoare triple {62637#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 99: Hoare triple {62637#false} ~skip~0 := 0; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 100: Hoare triple {62637#false} assume !false; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 101: Hoare triple {62637#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 102: Hoare triple {62637#false} assume 12292 == #t~mem43;havoc #t~mem43; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 103: Hoare triple {62637#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 104: Hoare triple {62637#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 105: Hoare triple {62637#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 106: Hoare triple {62637#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 107: Hoare triple {62637#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 108: Hoare triple {62637#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 109: Hoare triple {62637#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 110: Hoare triple {62637#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 111: Hoare triple {62637#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 112: Hoare triple {62637#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 113: Hoare triple {62637#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 114: Hoare triple {62637#false} ~skip~0 := 0; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 115: Hoare triple {62637#false} assume !false; {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 116: Hoare triple {62637#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,219 INFO L290 TraceCheckUtils]: 117: Hoare triple {62637#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 118: Hoare triple {62637#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 119: Hoare triple {62637#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 120: Hoare triple {62637#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 121: Hoare triple {62637#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 122: Hoare triple {62637#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 123: Hoare triple {62637#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 124: Hoare triple {62637#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 125: Hoare triple {62637#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 126: Hoare triple {62637#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 127: Hoare triple {62637#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 128: Hoare triple {62637#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 129: Hoare triple {62637#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 130: Hoare triple {62637#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 131: Hoare triple {62637#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 132: Hoare triple {62637#false} assume 4448 == #t~mem58;havoc #t~mem58; {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 133: Hoare triple {62637#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 134: Hoare triple {62637#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 135: Hoare triple {62637#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,220 INFO L290 TraceCheckUtils]: 136: Hoare triple {62637#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 137: Hoare triple {62637#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 138: Hoare triple {62637#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 139: Hoare triple {62637#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 140: Hoare triple {62637#false} ~skip~0 := 0; {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 141: Hoare triple {62637#false} assume !false; {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 142: Hoare triple {62637#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 143: Hoare triple {62637#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 144: Hoare triple {62637#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 145: Hoare triple {62637#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 146: Hoare triple {62637#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 147: Hoare triple {62637#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 148: Hoare triple {62637#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 149: Hoare triple {62637#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 150: Hoare triple {62637#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 151: Hoare triple {62637#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 152: Hoare triple {62637#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 153: Hoare triple {62637#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 154: Hoare triple {62637#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,221 INFO L290 TraceCheckUtils]: 155: Hoare triple {62637#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 156: Hoare triple {62637#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 157: Hoare triple {62637#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 158: Hoare triple {62637#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 159: Hoare triple {62637#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 160: Hoare triple {62637#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 161: Hoare triple {62637#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 162: Hoare triple {62637#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 163: Hoare triple {62637#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 164: Hoare triple {62637#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 165: Hoare triple {62637#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 166: Hoare triple {62637#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 167: Hoare triple {62637#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 168: Hoare triple {62637#false} assume 4512 == #t~mem68;havoc #t~mem68; {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 169: Hoare triple {62637#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 170: Hoare triple {62637#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 171: Hoare triple {62637#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 172: Hoare triple {62637#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {62637#false} is VALID [2022-04-28 15:17:05,222 INFO L290 TraceCheckUtils]: 173: Hoare triple {62637#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 174: Hoare triple {62637#false} assume !(0 == ~tmp___8~0); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 175: Hoare triple {62637#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 176: Hoare triple {62637#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 177: Hoare triple {62637#false} ~skip~0 := 0; {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 178: Hoare triple {62637#false} assume !false; {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 179: Hoare triple {62637#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 180: Hoare triple {62637#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 181: Hoare triple {62637#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 182: Hoare triple {62637#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 183: Hoare triple {62637#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 184: Hoare triple {62637#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 185: Hoare triple {62637#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 186: Hoare triple {62637#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 187: Hoare triple {62637#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 188: Hoare triple {62637#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 189: Hoare triple {62637#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 190: Hoare triple {62637#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 191: Hoare triple {62637#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,223 INFO L290 TraceCheckUtils]: 192: Hoare triple {62637#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62637#false} is VALID [2022-04-28 15:17:05,224 INFO L290 TraceCheckUtils]: 193: Hoare triple {62637#false} assume 4432 == #t~mem56;havoc #t~mem56; {62637#false} is VALID [2022-04-28 15:17:05,224 INFO L290 TraceCheckUtils]: 194: Hoare triple {62637#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {62637#false} is VALID [2022-04-28 15:17:05,224 INFO L290 TraceCheckUtils]: 195: Hoare triple {62637#false} assume 5 == ~blastFlag~0; {62637#false} is VALID [2022-04-28 15:17:05,224 INFO L290 TraceCheckUtils]: 196: Hoare triple {62637#false} assume !false; {62637#false} is VALID [2022-04-28 15:17:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-28 15:17:05,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:05,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956633547] [2022-04-28 15:17:05,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956633547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:05,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:05,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:05,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:05,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616439875] [2022-04-28 15:17:05,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616439875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:05,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:05,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:05,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385981226] [2022-04-28 15:17:05,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-28 15:17:05,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:05,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:05,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:05,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:05,322 INFO L87 Difference]: Start difference. First operand 962 states and 1432 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:07,341 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-28 15:17:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:08,466 INFO L93 Difference]: Finished difference Result 2368 states and 3493 transitions. [2022-04-28 15:17:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:08,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-28 15:17:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 15:17:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-28 15:17:08,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-28 15:17:08,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:08,839 INFO L225 Difference]: With dead ends: 2368 [2022-04-28 15:17:08,839 INFO L226 Difference]: Without dead ends: 1422 [2022-04-28 15:17:08,840 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-28 15:17:08,841 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 108 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:08,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 393 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-04-28 15:17:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1067. [2022-04-28 15:17:08,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:08,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1422 states. Second operand has 1067 states, 1062 states have (on average 1.4868173258003767) internal successors, (1579), 1062 states have internal predecessors, (1579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,886 INFO L74 IsIncluded]: Start isIncluded. First operand 1422 states. Second operand has 1067 states, 1062 states have (on average 1.4868173258003767) internal successors, (1579), 1062 states have internal predecessors, (1579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,887 INFO L87 Difference]: Start difference. First operand 1422 states. Second operand has 1067 states, 1062 states have (on average 1.4868173258003767) internal successors, (1579), 1062 states have internal predecessors, (1579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:08,936 INFO L93 Difference]: Finished difference Result 1422 states and 2067 transitions. [2022-04-28 15:17:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2067 transitions. [2022-04-28 15:17:08,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:08,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:08,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4868173258003767) internal successors, (1579), 1062 states have internal predecessors, (1579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1422 states. [2022-04-28 15:17:08,940 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4868173258003767) internal successors, (1579), 1062 states have internal predecessors, (1579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1422 states. [2022-04-28 15:17:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:09,005 INFO L93 Difference]: Finished difference Result 1422 states and 2067 transitions. [2022-04-28 15:17:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2067 transitions. [2022-04-28 15:17:09,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:09,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:09,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:09,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4868173258003767) internal successors, (1579), 1062 states have internal predecessors, (1579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1583 transitions. [2022-04-28 15:17:09,075 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1583 transitions. Word has length 197 [2022-04-28 15:17:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:09,075 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1583 transitions. [2022-04-28 15:17:09,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1583 transitions. [2022-04-28 15:17:10,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1583 edges. 1583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1583 transitions. [2022-04-28 15:17:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-28 15:17:10,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:10,357 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:17:10,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:17:10,357 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -448026992, now seen corresponding path program 1 times [2022-04-28 15:17:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1924910439] [2022-04-28 15:17:21,294 WARN L232 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:17:30,754 WARN L232 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:17:33,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -448026992, now seen corresponding path program 2 times [2022-04-28 15:17:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:33,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778764492] [2022-04-28 15:17:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:33,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {72369#(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(196, 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); {72362#true} is VALID [2022-04-28 15:17:33,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {72362#true} assume true; {72362#true} is VALID [2022-04-28 15:17:33,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72362#true} {72362#true} #592#return; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {72362#true} call ULTIMATE.init(); {72369#(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-28 15:17:33,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {72369#(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(196, 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); {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {72362#true} assume true; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72362#true} {72362#true} #592#return; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {72362#true} call #t~ret159 := main(); {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {72362#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {72362#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {72362#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {72362#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {72362#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {72362#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {72362#true} assume !false; {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {72362#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {72362#true} assume 12292 == #t~mem43;havoc #t~mem43; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {72362#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {72362#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {72362#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {72362#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {72362#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {72362#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {72362#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {72362#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {72362#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {72362#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {72362#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {72362#true} ~skip~0 := 0; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {72362#true} assume !false; {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {72362#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {72362#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {72362#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {72362#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {72362#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {72362#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {72362#true} assume 4368 == #t~mem48;havoc #t~mem48; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {72362#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {72362#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {72362#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {72362#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {72362#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {72362#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {72362#true} ~skip~0 := 0; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {72362#true} assume !false; {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {72362#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {72362#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {72362#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {72362#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {72362#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {72362#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {72362#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {72362#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {72362#true} assume 4384 == #t~mem50;havoc #t~mem50; {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {72362#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {72362#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {72362#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {72362#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {72362#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {72362#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {72362#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {72362#true} ~skip~0 := 0; {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {72362#true} assume !false; {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {72362#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {72362#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {72362#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {72362#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {72362#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {72362#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {72362#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {72362#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {72362#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {72362#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {72362#true} assume 4400 == #t~mem52;havoc #t~mem52; {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {72362#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {72362#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {72362#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {72362#true} assume !(~ret~0 <= 0); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {72362#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {72362#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 77: Hoare triple {72362#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 78: Hoare triple {72362#true} ~skip~0 := 0; {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 79: Hoare triple {72362#true} assume !false; {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 80: Hoare triple {72362#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {72362#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {72362#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,401 INFO L290 TraceCheckUtils]: 83: Hoare triple {72362#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {72362#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {72362#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 86: Hoare triple {72362#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 87: Hoare triple {72362#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {72362#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {72362#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {72362#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 91: Hoare triple {72362#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 92: Hoare triple {72362#true} assume 4416 == #t~mem54;havoc #t~mem54; {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {72362#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {72362#true} is VALID [2022-04-28 15:17:33,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {72362#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {72362#true} is VALID [2022-04-28 15:17:33,403 INFO L290 TraceCheckUtils]: 95: Hoare triple {72362#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:33,403 INFO L290 TraceCheckUtils]: 96: Hoare triple {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:33,404 INFO L290 TraceCheckUtils]: 97: Hoare triple {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:33,404 INFO L290 TraceCheckUtils]: 98: Hoare triple {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:33,404 INFO L290 TraceCheckUtils]: 99: Hoare triple {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:33,404 INFO L290 TraceCheckUtils]: 100: Hoare triple {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:33,405 INFO L290 TraceCheckUtils]: 101: Hoare triple {72367#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72368#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-28 15:17:33,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {72368#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {72363#false} is VALID [2022-04-28 15:17:33,405 INFO L290 TraceCheckUtils]: 103: Hoare triple {72363#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 104: Hoare triple {72363#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 105: Hoare triple {72363#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 106: Hoare triple {72363#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 107: Hoare triple {72363#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 108: Hoare triple {72363#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 109: Hoare triple {72363#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 110: Hoare triple {72363#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 111: Hoare triple {72363#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 112: Hoare triple {72363#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 113: Hoare triple {72363#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 114: Hoare triple {72363#false} ~skip~0 := 0; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 115: Hoare triple {72363#false} assume !false; {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 116: Hoare triple {72363#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,407 INFO L290 TraceCheckUtils]: 117: Hoare triple {72363#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 118: Hoare triple {72363#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 119: Hoare triple {72363#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 120: Hoare triple {72363#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 121: Hoare triple {72363#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 122: Hoare triple {72363#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 123: Hoare triple {72363#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 124: Hoare triple {72363#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 125: Hoare triple {72363#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 126: Hoare triple {72363#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 127: Hoare triple {72363#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 128: Hoare triple {72363#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 129: Hoare triple {72363#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 130: Hoare triple {72363#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 131: Hoare triple {72363#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {72363#false} assume 4448 == #t~mem58;havoc #t~mem58; {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 133: Hoare triple {72363#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {72363#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {72363#false} is VALID [2022-04-28 15:17:33,408 INFO L290 TraceCheckUtils]: 135: Hoare triple {72363#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 136: Hoare triple {72363#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 137: Hoare triple {72363#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 138: Hoare triple {72363#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 139: Hoare triple {72363#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 140: Hoare triple {72363#false} ~skip~0 := 0; {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 141: Hoare triple {72363#false} assume !false; {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 142: Hoare triple {72363#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 143: Hoare triple {72363#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 144: Hoare triple {72363#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 145: Hoare triple {72363#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 146: Hoare triple {72363#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 147: Hoare triple {72363#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 148: Hoare triple {72363#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 149: Hoare triple {72363#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 150: Hoare triple {72363#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 151: Hoare triple {72363#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,409 INFO L290 TraceCheckUtils]: 152: Hoare triple {72363#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 153: Hoare triple {72363#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 154: Hoare triple {72363#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 155: Hoare triple {72363#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 156: Hoare triple {72363#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 157: Hoare triple {72363#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 158: Hoare triple {72363#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 159: Hoare triple {72363#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 160: Hoare triple {72363#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 161: Hoare triple {72363#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 162: Hoare triple {72363#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 163: Hoare triple {72363#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 164: Hoare triple {72363#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 165: Hoare triple {72363#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 166: Hoare triple {72363#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 167: Hoare triple {72363#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 168: Hoare triple {72363#false} assume 4512 == #t~mem68;havoc #t~mem68; {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 169: Hoare triple {72363#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {72363#false} is VALID [2022-04-28 15:17:33,410 INFO L290 TraceCheckUtils]: 170: Hoare triple {72363#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 171: Hoare triple {72363#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 172: Hoare triple {72363#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 173: Hoare triple {72363#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 174: Hoare triple {72363#false} assume !(0 == ~tmp___8~0); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 175: Hoare triple {72363#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 176: Hoare triple {72363#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 177: Hoare triple {72363#false} ~skip~0 := 0; {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 178: Hoare triple {72363#false} assume !false; {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 179: Hoare triple {72363#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 180: Hoare triple {72363#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 181: Hoare triple {72363#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 182: Hoare triple {72363#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 183: Hoare triple {72363#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 184: Hoare triple {72363#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 185: Hoare triple {72363#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 186: Hoare triple {72363#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 187: Hoare triple {72363#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,411 INFO L290 TraceCheckUtils]: 188: Hoare triple {72363#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 189: Hoare triple {72363#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 190: Hoare triple {72363#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 191: Hoare triple {72363#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 192: Hoare triple {72363#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 193: Hoare triple {72363#false} assume 4432 == #t~mem56;havoc #t~mem56; {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 194: Hoare triple {72363#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 195: Hoare triple {72363#false} assume 5 == ~blastFlag~0; {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L290 TraceCheckUtils]: 196: Hoare triple {72363#false} assume !false; {72363#false} is VALID [2022-04-28 15:17:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:17:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778764492] [2022-04-28 15:17:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778764492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:33,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:33,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:33,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1924910439] [2022-04-28 15:17:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1924910439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:33,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:33,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877123022] [2022-04-28 15:17:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-28 15:17:33,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:33,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:33,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:33,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:33,499 INFO L87 Difference]: Start difference. First operand 1067 states and 1583 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:35,518 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-28 15:17:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:36,748 INFO L93 Difference]: Finished difference Result 2443 states and 3595 transitions. [2022-04-28 15:17:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:36,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-28 15:17:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 15:17:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 15:17:36,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 15:17:37,065 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-28 15:17:37,138 INFO L225 Difference]: With dead ends: 2443 [2022-04-28 15:17:37,138 INFO L226 Difference]: Without dead ends: 1392 [2022-04-28 15:17:37,140 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-28 15:17:37,140 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 108 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:37,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 314 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-04-28 15:17:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1067. [2022-04-28 15:17:37,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:37,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1392 states. Second operand has 1067 states, 1062 states have (on average 1.4689265536723164) internal successors, (1560), 1062 states have internal predecessors, (1560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,195 INFO L74 IsIncluded]: Start isIncluded. First operand 1392 states. Second operand has 1067 states, 1062 states have (on average 1.4689265536723164) internal successors, (1560), 1062 states have internal predecessors, (1560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,196 INFO L87 Difference]: Start difference. First operand 1392 states. Second operand has 1067 states, 1062 states have (on average 1.4689265536723164) internal successors, (1560), 1062 states have internal predecessors, (1560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:37,242 INFO L93 Difference]: Finished difference Result 1392 states and 2013 transitions. [2022-04-28 15:17:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2013 transitions. [2022-04-28 15:17:37,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:37,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:37,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4689265536723164) internal successors, (1560), 1062 states have internal predecessors, (1560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1392 states. [2022-04-28 15:17:37,246 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4689265536723164) internal successors, (1560), 1062 states have internal predecessors, (1560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1392 states. [2022-04-28 15:17:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:37,292 INFO L93 Difference]: Finished difference Result 1392 states and 2013 transitions. [2022-04-28 15:17:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2013 transitions. [2022-04-28 15:17:37,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:37,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:37,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:37,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4689265536723164) internal successors, (1560), 1062 states have internal predecessors, (1560), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1564 transitions. [2022-04-28 15:17:37,339 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1564 transitions. Word has length 197 [2022-04-28 15:17:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:37,339 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1564 transitions. [2022-04-28 15:17:37,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1564 transitions. [2022-04-28 15:17:38,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1564 edges. 1564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1564 transitions. [2022-04-28 15:17:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-04-28 15:17:38,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:38,690 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:38,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:17:38,690 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 356385574, now seen corresponding path program 1 times [2022-04-28 15:17:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:38,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429444872] [2022-04-28 15:18:00,780 WARN L232 SmtUtils]: Spent 13.87s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:18:10,118 WARN L232 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:18:12,487 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash 356385574, now seen corresponding path program 2 times [2022-04-28 15:18:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:12,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521904932] [2022-04-28 15:18:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:12,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {82185#(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(196, 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); {82178#true} is VALID [2022-04-28 15:18:12,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {82178#true} assume true; {82178#true} is VALID [2022-04-28 15:18:12,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82178#true} {82178#true} #592#return; {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {82178#true} call ULTIMATE.init(); {82185#(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-28 15:18:12,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {82185#(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(196, 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); {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {82178#true} assume true; {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82178#true} {82178#true} #592#return; {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {82178#true} call #t~ret159 := main(); {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {82178#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {82178#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {82178#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {82178#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {82178#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {82178#true} is VALID [2022-04-28 15:18:12,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {82178#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {82178#true} assume !false; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {82178#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {82178#true} assume 12292 == #t~mem43;havoc #t~mem43; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {82178#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {82178#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {82178#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {82178#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {82178#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {82178#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {82178#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {82178#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {82178#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {82178#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {82178#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {82178#true} ~skip~0 := 0; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {82178#true} assume !false; {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {82178#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {82178#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {82178#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {82178#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {82178#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {82178#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {82178#true} assume 4368 == #t~mem48;havoc #t~mem48; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {82178#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {82178#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {82178#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {82178#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {82178#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {82178#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {82178#true} ~skip~0 := 0; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {82178#true} assume !false; {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {82178#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {82178#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {82178#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {82178#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {82178#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {82178#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {82178#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {82178#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {82178#true} assume 4384 == #t~mem50;havoc #t~mem50; {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {82178#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {82178#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {82178#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {82178#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {82178#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {82178#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {82178#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {82178#true} ~skip~0 := 0; {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 59: Hoare triple {82178#true} assume !false; {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {82178#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {82178#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {82178#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 63: Hoare triple {82178#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 64: Hoare triple {82178#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,670 INFO L290 TraceCheckUtils]: 65: Hoare triple {82178#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {82178#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {82178#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {82178#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {82178#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {82178#true} assume 4400 == #t~mem52;havoc #t~mem52; {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {82178#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {82178#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {82178#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 74: Hoare triple {82178#true} assume !(~ret~0 <= 0); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 75: Hoare triple {82178#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {82178#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {82178#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {82178#true} ~skip~0 := 0; {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {82178#true} assume !false; {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {82178#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {82178#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {82178#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {82178#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,672 INFO L290 TraceCheckUtils]: 84: Hoare triple {82178#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,672 INFO L290 TraceCheckUtils]: 85: Hoare triple {82178#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,672 INFO L290 TraceCheckUtils]: 86: Hoare triple {82178#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,672 INFO L290 TraceCheckUtils]: 87: Hoare triple {82178#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,672 INFO L290 TraceCheckUtils]: 88: Hoare triple {82178#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,672 INFO L290 TraceCheckUtils]: 89: Hoare triple {82178#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,673 INFO L290 TraceCheckUtils]: 90: Hoare triple {82178#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,673 INFO L290 TraceCheckUtils]: 91: Hoare triple {82178#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82178#true} is VALID [2022-04-28 15:18:12,673 INFO L290 TraceCheckUtils]: 92: Hoare triple {82178#true} assume 4416 == #t~mem54;havoc #t~mem54; {82178#true} is VALID [2022-04-28 15:18:12,673 INFO L290 TraceCheckUtils]: 93: Hoare triple {82178#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {82178#true} is VALID [2022-04-28 15:18:12,673 INFO L290 TraceCheckUtils]: 94: Hoare triple {82178#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {82178#true} is VALID [2022-04-28 15:18:12,674 INFO L290 TraceCheckUtils]: 95: Hoare triple {82178#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,674 INFO L290 TraceCheckUtils]: 96: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,675 INFO L290 TraceCheckUtils]: 97: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,675 INFO L290 TraceCheckUtils]: 98: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,675 INFO L290 TraceCheckUtils]: 99: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,676 INFO L290 TraceCheckUtils]: 100: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,676 INFO L290 TraceCheckUtils]: 101: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,676 INFO L290 TraceCheckUtils]: 102: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,677 INFO L290 TraceCheckUtils]: 103: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,677 INFO L290 TraceCheckUtils]: 104: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:12,677 INFO L290 TraceCheckUtils]: 105: Hoare triple {82183#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82184#(= |ssl3_connect_#t~mem47| 4432)} is VALID [2022-04-28 15:18:12,677 INFO L290 TraceCheckUtils]: 106: Hoare triple {82184#(= |ssl3_connect_#t~mem47| 4432)} assume 4099 == #t~mem47;havoc #t~mem47; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 107: Hoare triple {82179#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 108: Hoare triple {82179#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 109: Hoare triple {82179#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 110: Hoare triple {82179#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 111: Hoare triple {82179#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 112: Hoare triple {82179#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 113: Hoare triple {82179#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 114: Hoare triple {82179#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 115: Hoare triple {82179#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 116: Hoare triple {82179#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 117: Hoare triple {82179#false} ~skip~0 := 0; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 118: Hoare triple {82179#false} assume !false; {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 119: Hoare triple {82179#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 120: Hoare triple {82179#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 121: Hoare triple {82179#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 122: Hoare triple {82179#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,678 INFO L290 TraceCheckUtils]: 123: Hoare triple {82179#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 124: Hoare triple {82179#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 125: Hoare triple {82179#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 126: Hoare triple {82179#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 127: Hoare triple {82179#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 128: Hoare triple {82179#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 129: Hoare triple {82179#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 130: Hoare triple {82179#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 131: Hoare triple {82179#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 132: Hoare triple {82179#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 133: Hoare triple {82179#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 134: Hoare triple {82179#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 135: Hoare triple {82179#false} assume 4448 == #t~mem58;havoc #t~mem58; {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 136: Hoare triple {82179#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 137: Hoare triple {82179#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 138: Hoare triple {82179#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 139: Hoare triple {82179#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 140: Hoare triple {82179#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,679 INFO L290 TraceCheckUtils]: 141: Hoare triple {82179#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 142: Hoare triple {82179#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 143: Hoare triple {82179#false} ~skip~0 := 0; {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 144: Hoare triple {82179#false} assume !false; {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 145: Hoare triple {82179#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 146: Hoare triple {82179#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 147: Hoare triple {82179#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 148: Hoare triple {82179#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 149: Hoare triple {82179#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 150: Hoare triple {82179#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 151: Hoare triple {82179#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 152: Hoare triple {82179#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 153: Hoare triple {82179#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 154: Hoare triple {82179#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 155: Hoare triple {82179#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 156: Hoare triple {82179#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 157: Hoare triple {82179#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 158: Hoare triple {82179#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,680 INFO L290 TraceCheckUtils]: 159: Hoare triple {82179#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 160: Hoare triple {82179#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 161: Hoare triple {82179#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 162: Hoare triple {82179#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 163: Hoare triple {82179#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 164: Hoare triple {82179#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 165: Hoare triple {82179#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 166: Hoare triple {82179#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 167: Hoare triple {82179#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 168: Hoare triple {82179#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 169: Hoare triple {82179#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 170: Hoare triple {82179#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 171: Hoare triple {82179#false} assume 4512 == #t~mem68;havoc #t~mem68; {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 172: Hoare triple {82179#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 173: Hoare triple {82179#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 174: Hoare triple {82179#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 175: Hoare triple {82179#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 176: Hoare triple {82179#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {82179#false} is VALID [2022-04-28 15:18:12,681 INFO L290 TraceCheckUtils]: 177: Hoare triple {82179#false} assume !(0 == ~tmp___8~0); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 178: Hoare triple {82179#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 179: Hoare triple {82179#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 180: Hoare triple {82179#false} ~skip~0 := 0; {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 181: Hoare triple {82179#false} assume !false; {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 182: Hoare triple {82179#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 183: Hoare triple {82179#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 184: Hoare triple {82179#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 185: Hoare triple {82179#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 186: Hoare triple {82179#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 187: Hoare triple {82179#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 188: Hoare triple {82179#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 189: Hoare triple {82179#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 190: Hoare triple {82179#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 191: Hoare triple {82179#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 192: Hoare triple {82179#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 193: Hoare triple {82179#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 194: Hoare triple {82179#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,682 INFO L290 TraceCheckUtils]: 195: Hoare triple {82179#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {82179#false} is VALID [2022-04-28 15:18:12,683 INFO L290 TraceCheckUtils]: 196: Hoare triple {82179#false} assume 4432 == #t~mem56;havoc #t~mem56; {82179#false} is VALID [2022-04-28 15:18:12,683 INFO L290 TraceCheckUtils]: 197: Hoare triple {82179#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {82179#false} is VALID [2022-04-28 15:18:12,683 INFO L290 TraceCheckUtils]: 198: Hoare triple {82179#false} assume 5 == ~blastFlag~0; {82179#false} is VALID [2022-04-28 15:18:12,683 INFO L290 TraceCheckUtils]: 199: Hoare triple {82179#false} assume !false; {82179#false} is VALID [2022-04-28 15:18:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:18:12,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:12,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521904932] [2022-04-28 15:18:12,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521904932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:12,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:12,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:12,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:12,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429444872] [2022-04-28 15:18:12,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429444872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:12,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:12,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300391030] [2022-04-28 15:18:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2022-04-28 15:18:12,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:12,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:12,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:12,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:12,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:12,775 INFO L87 Difference]: Start difference. First operand 1067 states and 1564 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,797 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-28 15:18:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:15,911 INFO L93 Difference]: Finished difference Result 2181 states and 3182 transitions. [2022-04-28 15:18:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:15,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2022-04-28 15:18:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2022-04-28 15:18:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2022-04-28 15:18:15,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 394 transitions. [2022-04-28 15:18:16,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:16,195 INFO L225 Difference]: With dead ends: 2181 [2022-04-28 15:18:16,195 INFO L226 Difference]: Without dead ends: 1130 [2022-04-28 15:18:16,196 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-28 15:18:16,196 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 40 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:16,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 499 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 372 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2022-04-28 15:18:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1067. [2022-04-28 15:18:16,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:16,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1130 states. Second operand has 1067 states, 1062 states have (on average 1.4651600753295668) internal successors, (1556), 1062 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:16,243 INFO L74 IsIncluded]: Start isIncluded. First operand 1130 states. Second operand has 1067 states, 1062 states have (on average 1.4651600753295668) internal successors, (1556), 1062 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:16,244 INFO L87 Difference]: Start difference. First operand 1130 states. Second operand has 1067 states, 1062 states have (on average 1.4651600753295668) internal successors, (1556), 1062 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:16,277 INFO L93 Difference]: Finished difference Result 1130 states and 1634 transitions. [2022-04-28 15:18:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1634 transitions. [2022-04-28 15:18:16,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:16,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:16,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4651600753295668) internal successors, (1556), 1062 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1130 states. [2022-04-28 15:18:16,280 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4651600753295668) internal successors, (1556), 1062 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1130 states. [2022-04-28 15:18:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:16,312 INFO L93 Difference]: Finished difference Result 1130 states and 1634 transitions. [2022-04-28 15:18:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1634 transitions. [2022-04-28 15:18:16,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:16,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:16,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:16,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4651600753295668) internal successors, (1556), 1062 states have internal predecessors, (1556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1560 transitions. [2022-04-28 15:18:16,359 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1560 transitions. Word has length 200 [2022-04-28 15:18:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:16,360 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1560 transitions. [2022-04-28 15:18:16,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:16,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1560 transitions. [2022-04-28 15:18:17,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1560 edges. 1560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1560 transitions. [2022-04-28 15:18:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-04-28 15:18:17,665 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:17,665 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:17,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:18:17,666 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -144707799, now seen corresponding path program 1 times [2022-04-28 15:18:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:17,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1161421297] [2022-04-28 15:18:28,172 WARN L232 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:18:45,015 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash -144707799, now seen corresponding path program 2 times [2022-04-28 15:18:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:45,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333437267] [2022-04-28 15:18:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:45,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {90954#(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(196, 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); {90946#true} is VALID [2022-04-28 15:18:45,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {90946#true} assume true; {90946#true} is VALID [2022-04-28 15:18:45,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90946#true} {90946#true} #592#return; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {90946#true} call ULTIMATE.init(); {90954#(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-28 15:18:45,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {90954#(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(196, 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); {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {90946#true} assume true; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90946#true} {90946#true} #592#return; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {90946#true} call #t~ret159 := main(); {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {90946#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L272 TraceCheckUtils]: 6: Hoare triple {90946#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {90946#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {90946#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {90946#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {90946#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {90946#true} assume 12292 == #t~mem43;havoc #t~mem43; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {90946#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {90946#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {90946#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {90946#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {90946#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {90946#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {90946#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {90946#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {90946#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {90946#true} assume 4368 == #t~mem48;havoc #t~mem48; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {90946#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {90946#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {90946#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {90946#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 50: Hoare triple {90946#true} assume 4384 == #t~mem50;havoc #t~mem50; {90946#true} is VALID [2022-04-28 15:18:45,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {90946#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {90946#true} is VALID [2022-04-28 15:18:45,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {90946#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90946#true} is VALID [2022-04-28 15:18:45,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {90946#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {90951#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:45,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {90951#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)))} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !false; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem52;havoc #t~mem52; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,213 INFO L290 TraceCheckUtils]: 73: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,213 INFO L290 TraceCheckUtils]: 74: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,215 INFO L290 TraceCheckUtils]: 79: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !false; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,215 INFO L290 TraceCheckUtils]: 80: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,215 INFO L290 TraceCheckUtils]: 81: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,216 INFO L290 TraceCheckUtils]: 82: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,216 INFO L290 TraceCheckUtils]: 83: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,216 INFO L290 TraceCheckUtils]: 84: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,216 INFO L290 TraceCheckUtils]: 85: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,216 INFO L290 TraceCheckUtils]: 86: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,217 INFO L290 TraceCheckUtils]: 87: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,217 INFO L290 TraceCheckUtils]: 88: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,217 INFO L290 TraceCheckUtils]: 89: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,217 INFO L290 TraceCheckUtils]: 90: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,218 INFO L290 TraceCheckUtils]: 92: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem54;havoc #t~mem54; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,218 INFO L290 TraceCheckUtils]: 93: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,218 INFO L290 TraceCheckUtils]: 94: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,219 INFO L290 TraceCheckUtils]: 95: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,220 INFO L290 TraceCheckUtils]: 96: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,220 INFO L290 TraceCheckUtils]: 97: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,220 INFO L290 TraceCheckUtils]: 98: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,220 INFO L290 TraceCheckUtils]: 99: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,221 INFO L290 TraceCheckUtils]: 100: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !false; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,221 INFO L290 TraceCheckUtils]: 101: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,221 INFO L290 TraceCheckUtils]: 102: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,221 INFO L290 TraceCheckUtils]: 103: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,222 INFO L290 TraceCheckUtils]: 104: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,222 INFO L290 TraceCheckUtils]: 105: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,222 INFO L290 TraceCheckUtils]: 106: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,222 INFO L290 TraceCheckUtils]: 107: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,223 INFO L290 TraceCheckUtils]: 108: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,223 INFO L290 TraceCheckUtils]: 109: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume 4384 == #t~mem50;havoc #t~mem50; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,223 INFO L290 TraceCheckUtils]: 110: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,223 INFO L290 TraceCheckUtils]: 111: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 112: Hoare triple {90952#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 128 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {90953#(= |ssl3_connect_#t~mem89| 0)} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 113: Hoare triple {90953#(= |ssl3_connect_#t~mem89| 0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 114: Hoare triple {90947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 115: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 116: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 117: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 118: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 119: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 120: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 121: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 122: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 123: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,224 INFO L290 TraceCheckUtils]: 124: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 125: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 126: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 127: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 128: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 129: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 130: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 131: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 132: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 133: Hoare triple {90947#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 134: Hoare triple {90947#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 135: Hoare triple {90947#false} assume 4448 == #t~mem58;havoc #t~mem58; {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 136: Hoare triple {90947#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 137: Hoare triple {90947#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 138: Hoare triple {90947#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 139: Hoare triple {90947#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 140: Hoare triple {90947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 141: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 142: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:18:45,225 INFO L290 TraceCheckUtils]: 143: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 144: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 145: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 146: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 147: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 148: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 149: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 150: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 151: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 152: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 153: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 154: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 155: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 156: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 157: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 158: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 159: Hoare triple {90947#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 160: Hoare triple {90947#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 161: Hoare triple {90947#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,226 INFO L290 TraceCheckUtils]: 162: Hoare triple {90947#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 163: Hoare triple {90947#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 164: Hoare triple {90947#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 165: Hoare triple {90947#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 166: Hoare triple {90947#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 167: Hoare triple {90947#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 168: Hoare triple {90947#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 169: Hoare triple {90947#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 170: Hoare triple {90947#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 171: Hoare triple {90947#false} assume 4512 == #t~mem68;havoc #t~mem68; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 172: Hoare triple {90947#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 173: Hoare triple {90947#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 174: Hoare triple {90947#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 175: Hoare triple {90947#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 176: Hoare triple {90947#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 177: Hoare triple {90947#false} assume !(0 == ~tmp___8~0); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 178: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 179: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 180: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:18:45,227 INFO L290 TraceCheckUtils]: 181: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 182: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 183: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 184: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 185: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 186: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 187: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 188: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 189: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 190: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 191: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 192: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 193: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 194: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 195: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 196: Hoare triple {90947#false} assume 4432 == #t~mem56;havoc #t~mem56; {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 197: Hoare triple {90947#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 198: Hoare triple {90947#false} assume 5 == ~blastFlag~0; {90947#false} is VALID [2022-04-28 15:18:45,228 INFO L290 TraceCheckUtils]: 199: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:18:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 301 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 15:18:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:45,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333437267] [2022-04-28 15:18:45,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333437267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 15:18:45,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130009527] [2022-04-28 15:18:45,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 15:18:45,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 15:18:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:18:45,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 15:18:45,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 15:19:15,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 15:19:15,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 15:19:16,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 15:19:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:16,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 15:19:16,163 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-28 15:19:16,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-28 15:19:16,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-28 15:19:16,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 15:19:16,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-28 15:19:16,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 15:19:16,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-28 15:19:16,536 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 15:19:16,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 15:19:16,647 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 15:19:16,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 15:19:16,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 15:19:16,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {90946#true} call ULTIMATE.init(); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {90946#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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(196, 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); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {90946#true} assume true; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90946#true} {90946#true} #592#return; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {90946#true} call #t~ret159 := main(); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {90946#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {90946#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {90946#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {90946#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {90946#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {90946#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {90946#true} assume 12292 == #t~mem43;havoc #t~mem43; {90946#true} is VALID [2022-04-28 15:19:16,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {90946#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {90946#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {90946#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {90946#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {90946#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {90946#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {90946#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {90946#true} is VALID [2022-04-28 15:19:16,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {90946#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {90946#true} is VALID [2022-04-28 15:19:16,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {90946#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !false; {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {91024#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 88 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {90946#true} assume 4368 == #t~mem48;havoc #t~mem48; {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {90946#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {90946#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {90946#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {90946#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {90946#true} assume 4384 == #t~mem50;havoc #t~mem50; {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {90946#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {90946#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {90946#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {90946#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,858 INFO L290 TraceCheckUtils]: 55: Hoare triple {90946#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {90946#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {90946#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {90946#true} assume 4400 == #t~mem52;havoc #t~mem52; {90946#true} is VALID [2022-04-28 15:19:16,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {90946#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {90946#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {90946#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {90946#true} assume !(~ret~0 <= 0); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {90946#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {90946#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,861 INFO L290 TraceCheckUtils]: 89: Hoare triple {90946#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {90946#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {90946#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:16,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {90946#true} assume 4416 == #t~mem54;havoc #t~mem54; {90946#true} is VALID [2022-04-28 15:19:16,861 INFO L290 TraceCheckUtils]: 93: Hoare triple {90946#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {90946#true} is VALID [2022-04-28 15:19:16,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {90946#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {90946#true} is VALID [2022-04-28 15:19:16,862 INFO L290 TraceCheckUtils]: 95: Hoare triple {90946#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,862 INFO L290 TraceCheckUtils]: 96: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,863 INFO L290 TraceCheckUtils]: 97: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,863 INFO L290 TraceCheckUtils]: 98: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,863 INFO L290 TraceCheckUtils]: 99: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,863 INFO L290 TraceCheckUtils]: 100: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,864 INFO L290 TraceCheckUtils]: 101: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,864 INFO L290 TraceCheckUtils]: 102: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,864 INFO L290 TraceCheckUtils]: 103: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,865 INFO L290 TraceCheckUtils]: 104: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,865 INFO L290 TraceCheckUtils]: 106: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 107: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 108: Hoare triple {91244#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91284#(= |ssl3_connect_#t~mem50| 4432)} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 109: Hoare triple {91284#(= |ssl3_connect_#t~mem50| 4432)} assume 4384 == #t~mem50;havoc #t~mem50; {90947#false} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 110: Hoare triple {90947#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {90947#false} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 111: Hoare triple {90947#false} assume !(1 == ~blastFlag~0); {90947#false} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 112: Hoare triple {90947#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 113: Hoare triple {90947#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,866 INFO L290 TraceCheckUtils]: 114: Hoare triple {90947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 115: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 116: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 117: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 118: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 119: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 120: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 121: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 122: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 123: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 124: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 125: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 126: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 127: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 128: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 129: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 130: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,867 INFO L290 TraceCheckUtils]: 131: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 132: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 133: Hoare triple {90947#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 134: Hoare triple {90947#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 135: Hoare triple {90947#false} assume 4448 == #t~mem58;havoc #t~mem58; {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 136: Hoare triple {90947#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 137: Hoare triple {90947#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 138: Hoare triple {90947#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 139: Hoare triple {90947#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 140: Hoare triple {90947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 141: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 142: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 143: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 144: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 145: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 146: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,868 INFO L290 TraceCheckUtils]: 147: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 148: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 149: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 150: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 151: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 152: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 153: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 154: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 155: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 156: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 157: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 158: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 159: Hoare triple {90947#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 160: Hoare triple {90947#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 161: Hoare triple {90947#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 162: Hoare triple {90947#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 163: Hoare triple {90947#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,869 INFO L290 TraceCheckUtils]: 164: Hoare triple {90947#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 165: Hoare triple {90947#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 166: Hoare triple {90947#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 167: Hoare triple {90947#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 168: Hoare triple {90947#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 169: Hoare triple {90947#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 170: Hoare triple {90947#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 171: Hoare triple {90947#false} assume 4512 == #t~mem68;havoc #t~mem68; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 172: Hoare triple {90947#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 173: Hoare triple {90947#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 174: Hoare triple {90947#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 175: Hoare triple {90947#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 176: Hoare triple {90947#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 177: Hoare triple {90947#false} assume !(0 == ~tmp___8~0); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 178: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 179: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 180: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:19:16,870 INFO L290 TraceCheckUtils]: 181: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 182: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 183: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 184: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 185: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 186: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 187: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 188: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 189: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 190: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 191: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 192: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 193: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 194: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 195: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 196: Hoare triple {90947#false} assume 4432 == #t~mem56;havoc #t~mem56; {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 197: Hoare triple {90947#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {90947#false} is VALID [2022-04-28 15:19:16,871 INFO L290 TraceCheckUtils]: 198: Hoare triple {90947#false} assume 5 == ~blastFlag~0; {90947#false} is VALID [2022-04-28 15:19:16,872 INFO L290 TraceCheckUtils]: 199: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 267 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 15:19:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 15:19:16,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-04-28 15:19:17,290 INFO L290 TraceCheckUtils]: 199: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:17,290 INFO L290 TraceCheckUtils]: 198: Hoare triple {90947#false} assume 5 == ~blastFlag~0; {90947#false} is VALID [2022-04-28 15:19:17,290 INFO L290 TraceCheckUtils]: 197: Hoare triple {90947#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {90947#false} is VALID [2022-04-28 15:19:17,290 INFO L290 TraceCheckUtils]: 196: Hoare triple {91567#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {90947#false} is VALID [2022-04-28 15:19:17,291 INFO L290 TraceCheckUtils]: 195: Hoare triple {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {91567#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-28 15:19:17,291 INFO L290 TraceCheckUtils]: 194: Hoare triple {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:19:17,292 INFO L290 TraceCheckUtils]: 193: Hoare triple {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:19:17,292 INFO L290 TraceCheckUtils]: 192: Hoare triple {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:19:17,292 INFO L290 TraceCheckUtils]: 191: Hoare triple {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 190: Hoare triple {91587#(or (= |ssl3_connect_#t~mem50| 4384) (not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {91571#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 189: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91587#(or (= |ssl3_connect_#t~mem50| 4384) (not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))))} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 188: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 187: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 186: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 185: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 184: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 183: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 182: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 181: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 180: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 179: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 178: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 177: Hoare triple {90947#false} assume !(0 == ~tmp___8~0); {90947#false} is VALID [2022-04-28 15:19:17,293 INFO L290 TraceCheckUtils]: 176: Hoare triple {90947#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 175: Hoare triple {90947#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 174: Hoare triple {90947#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 173: Hoare triple {90947#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 172: Hoare triple {90947#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 171: Hoare triple {90947#false} assume 4512 == #t~mem68;havoc #t~mem68; {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 170: Hoare triple {90947#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 169: Hoare triple {90947#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 168: Hoare triple {90947#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 167: Hoare triple {90947#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 166: Hoare triple {90947#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 165: Hoare triple {90947#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 164: Hoare triple {90947#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 163: Hoare triple {90947#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 162: Hoare triple {90947#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 161: Hoare triple {90947#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 160: Hoare triple {90947#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 159: Hoare triple {90947#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 158: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,294 INFO L290 TraceCheckUtils]: 157: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 156: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 155: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 154: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 153: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 152: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 151: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 150: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 149: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 148: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 147: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 146: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 145: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 144: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 143: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 142: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 141: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,295 INFO L290 TraceCheckUtils]: 140: Hoare triple {90947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 139: Hoare triple {90947#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 138: Hoare triple {90947#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 137: Hoare triple {90947#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 136: Hoare triple {90947#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 135: Hoare triple {90947#false} assume 4448 == #t~mem58;havoc #t~mem58; {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 134: Hoare triple {90947#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 133: Hoare triple {90947#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 132: Hoare triple {90947#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 131: Hoare triple {90947#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 130: Hoare triple {90947#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 129: Hoare triple {90947#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 128: Hoare triple {90947#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 127: Hoare triple {90947#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 126: Hoare triple {90947#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 125: Hoare triple {90947#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 124: Hoare triple {90947#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 123: Hoare triple {90947#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,296 INFO L290 TraceCheckUtils]: 122: Hoare triple {90947#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 121: Hoare triple {90947#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 120: Hoare triple {90947#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 119: Hoare triple {90947#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 118: Hoare triple {90947#false} assume !false; {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 117: Hoare triple {90947#false} ~skip~0 := 0; {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 116: Hoare triple {90947#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 115: Hoare triple {90947#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 114: Hoare triple {90947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 113: Hoare triple {90947#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 112: Hoare triple {90947#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 111: Hoare triple {90947#false} assume !(1 == ~blastFlag~0); {90947#false} is VALID [2022-04-28 15:19:17,297 INFO L290 TraceCheckUtils]: 110: Hoare triple {90947#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {90947#false} is VALID [2022-04-28 15:19:17,298 INFO L290 TraceCheckUtils]: 109: Hoare triple {91831#(not (= |ssl3_connect_#t~mem50| 4384))} assume 4384 == #t~mem50;havoc #t~mem50; {90947#false} is VALID [2022-04-28 15:19:17,298 INFO L290 TraceCheckUtils]: 108: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {91831#(not (= |ssl3_connect_#t~mem50| 4384))} is VALID [2022-04-28 15:19:17,298 INFO L290 TraceCheckUtils]: 107: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,299 INFO L290 TraceCheckUtils]: 106: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,299 INFO L290 TraceCheckUtils]: 105: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,299 INFO L290 TraceCheckUtils]: 104: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,300 INFO L290 TraceCheckUtils]: 103: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,300 INFO L290 TraceCheckUtils]: 100: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !false; {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,301 INFO L290 TraceCheckUtils]: 99: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} ~skip~0 := 0; {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,302 INFO L290 TraceCheckUtils]: 96: Hoare triple {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == ~tmp___6~0); {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 95: Hoare triple {90946#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {91835#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {90946#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {90946#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 92: Hoare triple {90946#true} assume 4416 == #t~mem54;havoc #t~mem54; {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 91: Hoare triple {90946#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {90946#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {90946#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {90946#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 87: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 83: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 82: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 79: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {90946#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {90946#true} assume !(~ret~0 <= 0); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {90946#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {90946#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {90946#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {90946#true} assume 4400 == #t~mem52;havoc #t~mem52; {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {90946#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {90946#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {90946#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {90946#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {90946#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {90946#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {90946#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {90946#true} assume 4384 == #t~mem50;havoc #t~mem50; {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {90946#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {90946#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {90946#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {90946#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {90946#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {90946#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {90946#true} assume 4368 == #t~mem48;havoc #t~mem48; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {90946#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {90946#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {90946#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {90946#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {90946#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {90946#true} ~skip~0 := 0; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {90946#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {90946#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {90946#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {90946#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {90946#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {90946#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {90946#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {90946#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {90946#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {90946#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {90946#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {90946#true} assume 12292 == #t~mem43;havoc #t~mem43; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {90946#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {90946#true} assume !false; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {90946#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {90946#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {90946#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {90946#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {90946#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {90946#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {90946#true} is VALID [2022-04-28 15:19:17,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {90946#true} call #t~ret159 := main(); {90946#true} is VALID [2022-04-28 15:19:17,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90946#true} {90946#true} #592#return; {90946#true} is VALID [2022-04-28 15:19:17,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {90946#true} assume true; {90946#true} is VALID [2022-04-28 15:19:17,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {90946#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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(196, 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); {90946#true} is VALID [2022-04-28 15:19:17,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {90946#true} call ULTIMATE.init(); {90946#true} is VALID [2022-04-28 15:19:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 273 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-04-28 15:19:17,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130009527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 15:19:17,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 15:19:17,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 14 [2022-04-28 15:19:17,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:17,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1161421297] [2022-04-28 15:19:17,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1161421297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:17,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:17,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:19:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911771052] [2022-04-28 15:19:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:17,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2022-04-28 15:19:17,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:17,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:17,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:17,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:19:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:17,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:19:17,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-28 15:19:17,390 INFO L87 Difference]: Start difference. First operand 1067 states and 1560 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:19,413 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-28 15:19:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:21,716 INFO L93 Difference]: Finished difference Result 3029 states and 4435 transitions. [2022-04-28 15:19:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:19:21,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2022-04-28 15:19:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2022-04-28 15:19:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2022-04-28 15:19:21,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 489 transitions. [2022-04-28 15:19:22,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:22,184 INFO L225 Difference]: With dead ends: 3029 [2022-04-28 15:19:22,185 INFO L226 Difference]: Without dead ends: 1978 [2022-04-28 15:19:22,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-04-28 15:19:22,187 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 92 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:22,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 756 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 710 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 15:19:22,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2022-04-28 15:19:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1901. [2022-04-28 15:19:22,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:22,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1978 states. Second operand has 1901 states, 1896 states have (on average 1.47415611814346) internal successors, (2795), 1896 states have internal predecessors, (2795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:22,306 INFO L74 IsIncluded]: Start isIncluded. First operand 1978 states. Second operand has 1901 states, 1896 states have (on average 1.47415611814346) internal successors, (2795), 1896 states have internal predecessors, (2795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:22,308 INFO L87 Difference]: Start difference. First operand 1978 states. Second operand has 1901 states, 1896 states have (on average 1.47415611814346) internal successors, (2795), 1896 states have internal predecessors, (2795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:22,405 INFO L93 Difference]: Finished difference Result 1978 states and 2890 transitions. [2022-04-28 15:19:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2890 transitions. [2022-04-28 15:19:22,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:22,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:22,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 1901 states, 1896 states have (on average 1.47415611814346) internal successors, (2795), 1896 states have internal predecessors, (2795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1978 states. [2022-04-28 15:19:22,412 INFO L87 Difference]: Start difference. First operand has 1901 states, 1896 states have (on average 1.47415611814346) internal successors, (2795), 1896 states have internal predecessors, (2795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1978 states. [2022-04-28 15:19:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:22,508 INFO L93 Difference]: Finished difference Result 1978 states and 2890 transitions. [2022-04-28 15:19:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2890 transitions. [2022-04-28 15:19:22,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:22,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:22,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:22,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1896 states have (on average 1.47415611814346) internal successors, (2795), 1896 states have internal predecessors, (2795), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2799 transitions. [2022-04-28 15:19:22,661 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2799 transitions. Word has length 200 [2022-04-28 15:19:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:22,661 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 2799 transitions. [2022-04-28 15:19:22,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:22,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1901 states and 2799 transitions. [2022-04-28 15:19:25,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2799 edges. 2799 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2799 transitions. [2022-04-28 15:19:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-04-28 15:19:25,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:25,182 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:25,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 15:19:25,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 15:19:25,387 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -730984021, now seen corresponding path program 1 times [2022-04-28 15:19:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:25,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225606432] [2022-04-28 15:19:40,003 WARN L232 SmtUtils]: Spent 11.91s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:19:58,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash -730984021, now seen corresponding path program 2 times [2022-04-28 15:19:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225085101] [2022-04-28 15:19:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:58,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {105987#(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(196, 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); {105980#true} is VALID [2022-04-28 15:19:58,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {105980#true} assume true; {105980#true} is VALID [2022-04-28 15:19:58,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105980#true} {105980#true} #592#return; {105980#true} is VALID [2022-04-28 15:19:58,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {105980#true} call ULTIMATE.init(); {105987#(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-28 15:19:58,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {105987#(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(196, 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); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {105980#true} assume true; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105980#true} {105980#true} #592#return; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {105980#true} call #t~ret159 := main(); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {105980#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {105980#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {105980#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {105980#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {105980#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {105980#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {105980#true} assume !false; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {105980#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {105980#true} assume 12292 == #t~mem43;havoc #t~mem43; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {105980#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {105980#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {105980#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {105980#true} is VALID [2022-04-28 15:19:58,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {105980#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {105980#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {105980#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {105980#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {105980#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {105980#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {105980#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {105980#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {105980#true} ~skip~0 := 0; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {105980#true} assume !false; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {105980#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {105980#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {105980#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {105980#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {105980#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {105980#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {105980#true} assume 4368 == #t~mem48;havoc #t~mem48; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {105980#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {105980#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105980#true} is VALID [2022-04-28 15:19:58,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {105980#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {105980#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {105980#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {105980#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {105980#true} ~skip~0 := 0; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {105980#true} assume !false; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {105980#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {105980#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {105980#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {105980#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {105980#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {105980#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {105980#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {105980#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {105980#true} assume 4384 == #t~mem50;havoc #t~mem50; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {105980#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {105980#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {105980#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {105980#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {105980#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {105980#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {105980#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {105980#true} ~skip~0 := 0; {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {105980#true} assume !false; {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {105980#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {105980#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {105980#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {105980#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {105980#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {105980#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 66: Hoare triple {105980#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {105980#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {105980#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {105980#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {105980#true} assume 4400 == #t~mem52;havoc #t~mem52; {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {105980#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {105980#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 73: Hoare triple {105980#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105980#true} is VALID [2022-04-28 15:19:58,606 INFO L290 TraceCheckUtils]: 74: Hoare triple {105980#true} assume !(~ret~0 <= 0); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {105980#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 76: Hoare triple {105980#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 77: Hoare triple {105980#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 78: Hoare triple {105980#true} ~skip~0 := 0; {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 79: Hoare triple {105980#true} assume !false; {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 80: Hoare triple {105980#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 81: Hoare triple {105980#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 82: Hoare triple {105980#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 83: Hoare triple {105980#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {105980#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {105980#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 86: Hoare triple {105980#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 87: Hoare triple {105980#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 88: Hoare triple {105980#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 89: Hoare triple {105980#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 90: Hoare triple {105980#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 91: Hoare triple {105980#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 92: Hoare triple {105980#true} assume 4416 == #t~mem54;havoc #t~mem54; {105980#true} is VALID [2022-04-28 15:19:58,607 INFO L290 TraceCheckUtils]: 93: Hoare triple {105980#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {105980#true} is VALID [2022-04-28 15:19:58,608 INFO L290 TraceCheckUtils]: 94: Hoare triple {105980#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105980#true} is VALID [2022-04-28 15:19:58,609 INFO L290 TraceCheckUtils]: 95: Hoare triple {105980#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,609 INFO L290 TraceCheckUtils]: 96: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == ~tmp___6~0); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,609 INFO L290 TraceCheckUtils]: 97: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,609 INFO L290 TraceCheckUtils]: 99: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} ~skip~0 := 0; {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !false; {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,610 INFO L290 TraceCheckUtils]: 102: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,610 INFO L290 TraceCheckUtils]: 103: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,611 INFO L290 TraceCheckUtils]: 104: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,611 INFO L290 TraceCheckUtils]: 105: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,611 INFO L290 TraceCheckUtils]: 106: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,611 INFO L290 TraceCheckUtils]: 107: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 108: Hoare triple {105985#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105986#(not (= |ssl3_connect_#t~mem50| 4384))} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 109: Hoare triple {105986#(not (= |ssl3_connect_#t~mem50| 4384))} assume 4384 == #t~mem50;havoc #t~mem50; {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 110: Hoare triple {105981#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 111: Hoare triple {105981#false} assume !(1 == ~blastFlag~0); {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 112: Hoare triple {105981#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 113: Hoare triple {105981#false} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 114: Hoare triple {105981#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 115: Hoare triple {105981#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 116: Hoare triple {105981#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 117: Hoare triple {105981#false} ~skip~0 := 0; {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 118: Hoare triple {105981#false} assume !false; {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 119: Hoare triple {105981#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,612 INFO L290 TraceCheckUtils]: 120: Hoare triple {105981#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 121: Hoare triple {105981#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 122: Hoare triple {105981#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 123: Hoare triple {105981#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 124: Hoare triple {105981#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 125: Hoare triple {105981#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 126: Hoare triple {105981#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 127: Hoare triple {105981#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 128: Hoare triple {105981#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 129: Hoare triple {105981#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 130: Hoare triple {105981#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 131: Hoare triple {105981#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 132: Hoare triple {105981#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 133: Hoare triple {105981#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 134: Hoare triple {105981#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 135: Hoare triple {105981#false} assume 4448 == #t~mem58;havoc #t~mem58; {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 136: Hoare triple {105981#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 137: Hoare triple {105981#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 138: Hoare triple {105981#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,613 INFO L290 TraceCheckUtils]: 139: Hoare triple {105981#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 140: Hoare triple {105981#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 141: Hoare triple {105981#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 142: Hoare triple {105981#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 143: Hoare triple {105981#false} ~skip~0 := 0; {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 144: Hoare triple {105981#false} assume !false; {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 145: Hoare triple {105981#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 146: Hoare triple {105981#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 147: Hoare triple {105981#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 148: Hoare triple {105981#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 149: Hoare triple {105981#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 150: Hoare triple {105981#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 151: Hoare triple {105981#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 152: Hoare triple {105981#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 153: Hoare triple {105981#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 154: Hoare triple {105981#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 155: Hoare triple {105981#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 156: Hoare triple {105981#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 157: Hoare triple {105981#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 158: Hoare triple {105981#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,614 INFO L290 TraceCheckUtils]: 159: Hoare triple {105981#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 160: Hoare triple {105981#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 161: Hoare triple {105981#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 162: Hoare triple {105981#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 163: Hoare triple {105981#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 164: Hoare triple {105981#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 165: Hoare triple {105981#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 166: Hoare triple {105981#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 167: Hoare triple {105981#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 168: Hoare triple {105981#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 169: Hoare triple {105981#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 170: Hoare triple {105981#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 171: Hoare triple {105981#false} assume 4512 == #t~mem68;havoc #t~mem68; {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 172: Hoare triple {105981#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 173: Hoare triple {105981#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 174: Hoare triple {105981#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 175: Hoare triple {105981#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 176: Hoare triple {105981#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {105981#false} is VALID [2022-04-28 15:19:58,615 INFO L290 TraceCheckUtils]: 177: Hoare triple {105981#false} assume !(0 == ~tmp___8~0); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 178: Hoare triple {105981#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 179: Hoare triple {105981#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 180: Hoare triple {105981#false} ~skip~0 := 0; {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 181: Hoare triple {105981#false} assume !false; {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 182: Hoare triple {105981#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 183: Hoare triple {105981#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 184: Hoare triple {105981#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 185: Hoare triple {105981#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 186: Hoare triple {105981#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 187: Hoare triple {105981#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 188: Hoare triple {105981#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 189: Hoare triple {105981#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 190: Hoare triple {105981#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 191: Hoare triple {105981#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 192: Hoare triple {105981#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 193: Hoare triple {105981#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 194: Hoare triple {105981#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 195: Hoare triple {105981#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 196: Hoare triple {105981#false} assume 4432 == #t~mem56;havoc #t~mem56; {105981#false} is VALID [2022-04-28 15:19:58,616 INFO L290 TraceCheckUtils]: 197: Hoare triple {105981#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {105981#false} is VALID [2022-04-28 15:19:58,617 INFO L290 TraceCheckUtils]: 198: Hoare triple {105981#false} assume 5 == ~blastFlag~0; {105981#false} is VALID [2022-04-28 15:19:58,617 INFO L290 TraceCheckUtils]: 199: Hoare triple {105981#false} assume !false; {105981#false} is VALID [2022-04-28 15:19:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:19:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225085101] [2022-04-28 15:19:58,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225085101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:58,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:58,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:58,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:58,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225606432] [2022-04-28 15:19:58,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225606432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:58,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:58,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779218036] [2022-04-28 15:19:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2022-04-28 15:19:58,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:58,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:58,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:58,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:58,702 INFO L87 Difference]: Start difference. First operand 1901 states and 2799 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:00,725 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-28 15:20:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:02,624 INFO L93 Difference]: Finished difference Result 4370 states and 6396 transitions. [2022-04-28 15:20:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2022-04-28 15:20:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:20:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:20:02,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 15:20:02,942 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-28 15:20:03,184 INFO L225 Difference]: With dead ends: 4370 [2022-04-28 15:20:03,184 INFO L226 Difference]: Without dead ends: 2485 [2022-04-28 15:20:03,187 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-28 15:20:03,187 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:03,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 302 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 393 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:20:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2022-04-28 15:20:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 1901. [2022-04-28 15:20:03,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:03,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2485 states. Second operand has 1901 states, 1896 states have (on average 1.4567510548523206) internal successors, (2762), 1896 states have internal predecessors, (2762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:03,305 INFO L74 IsIncluded]: Start isIncluded. First operand 2485 states. Second operand has 1901 states, 1896 states have (on average 1.4567510548523206) internal successors, (2762), 1896 states have internal predecessors, (2762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:03,307 INFO L87 Difference]: Start difference. First operand 2485 states. Second operand has 1901 states, 1896 states have (on average 1.4567510548523206) internal successors, (2762), 1896 states have internal predecessors, (2762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:03,463 INFO L93 Difference]: Finished difference Result 2485 states and 3584 transitions. [2022-04-28 15:20:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3584 transitions. [2022-04-28 15:20:03,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:03,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 1901 states, 1896 states have (on average 1.4567510548523206) internal successors, (2762), 1896 states have internal predecessors, (2762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2485 states. [2022-04-28 15:20:03,469 INFO L87 Difference]: Start difference. First operand has 1901 states, 1896 states have (on average 1.4567510548523206) internal successors, (2762), 1896 states have internal predecessors, (2762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2485 states. [2022-04-28 15:20:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:03,626 INFO L93 Difference]: Finished difference Result 2485 states and 3584 transitions. [2022-04-28 15:20:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3584 transitions. [2022-04-28 15:20:03,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:03,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:03,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:03,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1896 states have (on average 1.4567510548523206) internal successors, (2762), 1896 states have internal predecessors, (2762), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2766 transitions. [2022-04-28 15:20:03,811 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2766 transitions. Word has length 200 [2022-04-28 15:20:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:03,811 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 2766 transitions. [2022-04-28 15:20:03,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:03,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1901 states and 2766 transitions. [2022-04-28 15:20:06,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2766 edges. 2766 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2766 transitions. [2022-04-28 15:20:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-28 15:20:06,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:06,461 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:06,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:20:06,461 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:06,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -234182702, now seen corresponding path program 1 times [2022-04-28 15:20:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:06,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933313585] [2022-04-28 15:20:23,557 WARN L232 SmtUtils]: Spent 13.83s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:20:41,384 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -234182702, now seen corresponding path program 2 times [2022-04-28 15:20:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607992616] [2022-04-28 15:20:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:41,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {123511#(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(196, 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); {123504#true} is VALID [2022-04-28 15:20:41,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {123504#true} assume true; {123504#true} is VALID [2022-04-28 15:20:41,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123504#true} {123504#true} #592#return; {123504#true} is VALID [2022-04-28 15:20:41,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {123504#true} call ULTIMATE.init(); {123511#(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-28 15:20:41,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {123511#(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(196, 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); {123504#true} is VALID [2022-04-28 15:20:41,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {123504#true} assume true; {123504#true} is VALID [2022-04-28 15:20:41,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123504#true} {123504#true} #592#return; {123504#true} is VALID [2022-04-28 15:20:41,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {123504#true} call #t~ret159 := main(); {123504#true} is VALID [2022-04-28 15:20:41,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {123504#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {123504#true} is VALID [2022-04-28 15:20:41,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {123504#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {123504#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {123504#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {123504#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {123504#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {123504#true} assume !false; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {123504#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {123504#true} assume 12292 == #t~mem43;havoc #t~mem43; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {123504#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {123504#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {123504#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {123504#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {123504#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {123504#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {123504#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {123504#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {123504#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {123504#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {123504#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {123504#true} ~skip~0 := 0; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {123504#true} assume !false; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {123504#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {123504#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {123504#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {123504#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {123504#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {123504#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {123504#true} assume 4368 == #t~mem48;havoc #t~mem48; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {123504#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {123504#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {123504#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {123504#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {123504#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {123504#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {123504#true} ~skip~0 := 0; {123504#true} is VALID [2022-04-28 15:20:41,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {123504#true} assume !false; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {123504#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {123504#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {123504#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {123504#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {123504#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {123504#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {123504#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 49: Hoare triple {123504#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {123504#true} assume 4384 == #t~mem50;havoc #t~mem50; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {123504#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {123504#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {123504#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {123504#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {123504#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {123504#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {123504#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {123504#true} ~skip~0 := 0; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {123504#true} assume !false; {123504#true} is VALID [2022-04-28 15:20:41,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {123504#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {123504#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {123504#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {123504#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 64: Hoare triple {123504#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {123504#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {123504#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {123504#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {123504#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {123504#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {123504#true} assume 4400 == #t~mem52;havoc #t~mem52; {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {123504#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {123504#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {123504#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {123504#true} assume !(~ret~0 <= 0); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {123504#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {123504#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {123504#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {123504#true} ~skip~0 := 0; {123504#true} is VALID [2022-04-28 15:20:41,553 INFO L290 TraceCheckUtils]: 79: Hoare triple {123504#true} assume !false; {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {123504#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 81: Hoare triple {123504#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 82: Hoare triple {123504#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 83: Hoare triple {123504#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 84: Hoare triple {123504#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {123504#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {123504#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 87: Hoare triple {123504#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 88: Hoare triple {123504#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 89: Hoare triple {123504#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 90: Hoare triple {123504#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 91: Hoare triple {123504#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {123504#true} assume 4416 == #t~mem54;havoc #t~mem54; {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 93: Hoare triple {123504#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {123504#true} is VALID [2022-04-28 15:20:41,554 INFO L290 TraceCheckUtils]: 94: Hoare triple {123504#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {123504#true} is VALID [2022-04-28 15:20:41,555 INFO L290 TraceCheckUtils]: 95: Hoare triple {123504#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,556 INFO L290 TraceCheckUtils]: 96: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,556 INFO L290 TraceCheckUtils]: 97: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,556 INFO L290 TraceCheckUtils]: 98: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,557 INFO L290 TraceCheckUtils]: 99: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,557 INFO L290 TraceCheckUtils]: 100: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,557 INFO L290 TraceCheckUtils]: 101: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,557 INFO L290 TraceCheckUtils]: 102: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,558 INFO L290 TraceCheckUtils]: 103: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,558 INFO L290 TraceCheckUtils]: 104: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,558 INFO L290 TraceCheckUtils]: 105: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,559 INFO L290 TraceCheckUtils]: 107: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,559 INFO L290 TraceCheckUtils]: 108: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:41,559 INFO L290 TraceCheckUtils]: 109: Hoare triple {123509#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {123510#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 110: Hoare triple {123510#(= |ssl3_connect_#t~mem51| 4432)} assume 4385 == #t~mem51;havoc #t~mem51; {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 111: Hoare triple {123505#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 112: Hoare triple {123505#false} assume !(1 == ~blastFlag~0); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 113: Hoare triple {123505#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 114: Hoare triple {123505#false} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 115: Hoare triple {123505#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 116: Hoare triple {123505#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {123505#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 118: Hoare triple {123505#false} ~skip~0 := 0; {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 119: Hoare triple {123505#false} assume !false; {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 120: Hoare triple {123505#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 121: Hoare triple {123505#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 122: Hoare triple {123505#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,560 INFO L290 TraceCheckUtils]: 123: Hoare triple {123505#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 124: Hoare triple {123505#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 125: Hoare triple {123505#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 126: Hoare triple {123505#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 127: Hoare triple {123505#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 128: Hoare triple {123505#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 129: Hoare triple {123505#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 130: Hoare triple {123505#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 131: Hoare triple {123505#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 132: Hoare triple {123505#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 133: Hoare triple {123505#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 134: Hoare triple {123505#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 135: Hoare triple {123505#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 136: Hoare triple {123505#false} assume 4448 == #t~mem58;havoc #t~mem58; {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 137: Hoare triple {123505#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 138: Hoare triple {123505#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 139: Hoare triple {123505#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 140: Hoare triple {123505#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 141: Hoare triple {123505#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,561 INFO L290 TraceCheckUtils]: 142: Hoare triple {123505#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 143: Hoare triple {123505#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 144: Hoare triple {123505#false} ~skip~0 := 0; {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 145: Hoare triple {123505#false} assume !false; {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 146: Hoare triple {123505#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 147: Hoare triple {123505#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 148: Hoare triple {123505#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 149: Hoare triple {123505#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 150: Hoare triple {123505#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 151: Hoare triple {123505#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 152: Hoare triple {123505#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 153: Hoare triple {123505#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 154: Hoare triple {123505#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 155: Hoare triple {123505#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 156: Hoare triple {123505#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 157: Hoare triple {123505#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,562 INFO L290 TraceCheckUtils]: 158: Hoare triple {123505#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 159: Hoare triple {123505#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 160: Hoare triple {123505#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 161: Hoare triple {123505#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 162: Hoare triple {123505#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 163: Hoare triple {123505#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 164: Hoare triple {123505#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,569 INFO L290 TraceCheckUtils]: 165: Hoare triple {123505#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 166: Hoare triple {123505#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 167: Hoare triple {123505#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 168: Hoare triple {123505#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 169: Hoare triple {123505#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 170: Hoare triple {123505#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 171: Hoare triple {123505#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 172: Hoare triple {123505#false} assume 4512 == #t~mem68;havoc #t~mem68; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 173: Hoare triple {123505#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 174: Hoare triple {123505#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 175: Hoare triple {123505#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 176: Hoare triple {123505#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 177: Hoare triple {123505#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 178: Hoare triple {123505#false} assume !(0 == ~tmp___8~0); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 179: Hoare triple {123505#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 180: Hoare triple {123505#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 181: Hoare triple {123505#false} ~skip~0 := 0; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 182: Hoare triple {123505#false} assume !false; {123505#false} is VALID [2022-04-28 15:20:41,570 INFO L290 TraceCheckUtils]: 183: Hoare triple {123505#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 184: Hoare triple {123505#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 185: Hoare triple {123505#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 186: Hoare triple {123505#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 187: Hoare triple {123505#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 188: Hoare triple {123505#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 189: Hoare triple {123505#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 190: Hoare triple {123505#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 191: Hoare triple {123505#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 192: Hoare triple {123505#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 193: Hoare triple {123505#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 194: Hoare triple {123505#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 195: Hoare triple {123505#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 196: Hoare triple {123505#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 197: Hoare triple {123505#false} assume 4432 == #t~mem56;havoc #t~mem56; {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 198: Hoare triple {123505#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 199: Hoare triple {123505#false} assume 5 == ~blastFlag~0; {123505#false} is VALID [2022-04-28 15:20:41,571 INFO L290 TraceCheckUtils]: 200: Hoare triple {123505#false} assume !false; {123505#false} is VALID [2022-04-28 15:20:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:20:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607992616] [2022-04-28 15:20:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607992616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:41,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:41,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933313585] [2022-04-28 15:20:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933313585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:41,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300199788] [2022-04-28 15:20:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-28 15:20:41,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:41,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:41,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:41,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:41,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:41,683 INFO L87 Difference]: Start difference. First operand 1901 states and 2766 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:43,706 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-28 15:20:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:45,331 INFO L93 Difference]: Finished difference Result 3878 states and 5617 transitions. [2022-04-28 15:20:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-28 15:20:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-28 15:20:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-28 15:20:45,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-28 15:20:45,577 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-28 15:20:45,727 INFO L225 Difference]: With dead ends: 3878 [2022-04-28 15:20:45,727 INFO L226 Difference]: Without dead ends: 1993 [2022-04-28 15:20:45,729 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-28 15:20:45,730 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 30 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:45,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 489 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:20:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-04-28 15:20:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1901. [2022-04-28 15:20:45,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:45,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1993 states. Second operand has 1901 states, 1896 states have (on average 1.4525316455696202) internal successors, (2754), 1896 states have internal predecessors, (2754), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:45,839 INFO L74 IsIncluded]: Start isIncluded. First operand 1993 states. Second operand has 1901 states, 1896 states have (on average 1.4525316455696202) internal successors, (2754), 1896 states have internal predecessors, (2754), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:45,840 INFO L87 Difference]: Start difference. First operand 1993 states. Second operand has 1901 states, 1896 states have (on average 1.4525316455696202) internal successors, (2754), 1896 states have internal predecessors, (2754), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:45,942 INFO L93 Difference]: Finished difference Result 1993 states and 2863 transitions. [2022-04-28 15:20:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2863 transitions. [2022-04-28 15:20:45,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:45,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:45,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 1901 states, 1896 states have (on average 1.4525316455696202) internal successors, (2754), 1896 states have internal predecessors, (2754), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1993 states. [2022-04-28 15:20:45,948 INFO L87 Difference]: Start difference. First operand has 1901 states, 1896 states have (on average 1.4525316455696202) internal successors, (2754), 1896 states have internal predecessors, (2754), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1993 states. [2022-04-28 15:20:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:46,047 INFO L93 Difference]: Finished difference Result 1993 states and 2863 transitions. [2022-04-28 15:20:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2863 transitions. [2022-04-28 15:20:46,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:46,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:46,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:46,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1896 states have (on average 1.4525316455696202) internal successors, (2754), 1896 states have internal predecessors, (2754), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2758 transitions. [2022-04-28 15:20:46,214 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2758 transitions. Word has length 201 [2022-04-28 15:20:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:46,215 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 2758 transitions. [2022-04-28 15:20:46,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:46,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1901 states and 2758 transitions. [2022-04-28 15:20:48,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2758 edges. 2758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2758 transitions. [2022-04-28 15:20:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-28 15:20:48,809 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:48,809 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:48,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:20:48,809 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 232338556, now seen corresponding path program 1 times [2022-04-28 15:20:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:48,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072461399] [2022-04-28 15:21:02,414 WARN L232 SmtUtils]: Spent 11.01s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:21:19,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 232338556, now seen corresponding path program 2 times [2022-04-28 15:21:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:19,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279721959] [2022-04-28 15:21:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:19,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {139067#(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(196, 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); {139060#true} is VALID [2022-04-28 15:21:19,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {139060#true} assume true; {139060#true} is VALID [2022-04-28 15:21:19,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139060#true} {139060#true} #592#return; {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {139060#true} call ULTIMATE.init(); {139067#(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-28 15:21:19,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {139067#(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(196, 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); {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {139060#true} assume true; {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139060#true} {139060#true} #592#return; {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {139060#true} call #t~ret159 := main(); {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {139060#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {139060#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {139060#true} is VALID [2022-04-28 15:21:19,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {139060#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {139060#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {139060#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {139060#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {139060#true} assume !false; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {139060#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {139060#true} assume 12292 == #t~mem43;havoc #t~mem43; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {139060#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {139060#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {139060#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {139060#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {139060#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {139060#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {139060#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {139060#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {139060#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {139060#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {139060#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {139060#true} ~skip~0 := 0; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {139060#true} assume !false; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {139060#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {139060#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {139060#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {139060#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {139060#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {139060#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {139060#true} assume 4368 == #t~mem48;havoc #t~mem48; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {139060#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {139060#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {139060#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {139060#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {139060#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {139060#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {139060#true} ~skip~0 := 0; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {139060#true} assume !false; {139060#true} is VALID [2022-04-28 15:21:19,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {139060#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {139060#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {139060#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {139060#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {139060#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {139060#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {139060#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {139060#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {139060#true} assume 4384 == #t~mem50;havoc #t~mem50; {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {139060#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {139060#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {139060#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {139060#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {139060#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {139060#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {139060#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {139060#true} ~skip~0 := 0; {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {139060#true} assume !false; {139060#true} is VALID [2022-04-28 15:21:19,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {139060#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {139060#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {139060#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {139060#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {139060#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {139060#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {139060#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {139060#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {139060#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {139060#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {139060#true} assume 4400 == #t~mem52;havoc #t~mem52; {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {139060#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {139060#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {139060#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {139060#true} assume !(~ret~0 <= 0); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 75: Hoare triple {139060#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {139060#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {139060#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {139060#true} ~skip~0 := 0; {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {139060#true} assume !false; {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 80: Hoare triple {139060#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 81: Hoare triple {139060#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 82: Hoare triple {139060#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 83: Hoare triple {139060#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {139060#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 85: Hoare triple {139060#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 86: Hoare triple {139060#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 87: Hoare triple {139060#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 88: Hoare triple {139060#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 89: Hoare triple {139060#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 90: Hoare triple {139060#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,926 INFO L290 TraceCheckUtils]: 91: Hoare triple {139060#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {139060#true} is VALID [2022-04-28 15:21:19,927 INFO L290 TraceCheckUtils]: 92: Hoare triple {139060#true} assume 4416 == #t~mem54;havoc #t~mem54; {139060#true} is VALID [2022-04-28 15:21:19,927 INFO L290 TraceCheckUtils]: 93: Hoare triple {139060#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {139060#true} is VALID [2022-04-28 15:21:19,927 INFO L290 TraceCheckUtils]: 94: Hoare triple {139060#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {139060#true} is VALID [2022-04-28 15:21:19,928 INFO L290 TraceCheckUtils]: 95: Hoare triple {139060#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,928 INFO L290 TraceCheckUtils]: 96: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,929 INFO L290 TraceCheckUtils]: 97: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,929 INFO L290 TraceCheckUtils]: 98: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,931 INFO L290 TraceCheckUtils]: 102: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,931 INFO L290 TraceCheckUtils]: 103: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,931 INFO L290 TraceCheckUtils]: 104: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,932 INFO L290 TraceCheckUtils]: 105: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,932 INFO L290 TraceCheckUtils]: 106: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,932 INFO L290 TraceCheckUtils]: 107: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,933 INFO L290 TraceCheckUtils]: 108: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,933 INFO L290 TraceCheckUtils]: 109: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,933 INFO L290 TraceCheckUtils]: 110: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:19,934 INFO L290 TraceCheckUtils]: 111: Hoare triple {139065#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {139066#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-28 15:21:19,934 INFO L290 TraceCheckUtils]: 112: Hoare triple {139066#(= |ssl3_connect_#t~mem53| 4432)} assume 4401 == #t~mem53;havoc #t~mem53; {139061#false} is VALID [2022-04-28 15:21:19,934 INFO L290 TraceCheckUtils]: 113: Hoare triple {139061#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {139061#false} is VALID [2022-04-28 15:21:19,934 INFO L290 TraceCheckUtils]: 114: Hoare triple {139061#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {139061#false} is VALID [2022-04-28 15:21:19,934 INFO L290 TraceCheckUtils]: 115: Hoare triple {139061#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 116: Hoare triple {139061#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 117: Hoare triple {139061#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 118: Hoare triple {139061#false} ~skip~0 := 0; {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 119: Hoare triple {139061#false} assume !false; {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 120: Hoare triple {139061#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 121: Hoare triple {139061#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 122: Hoare triple {139061#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 123: Hoare triple {139061#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 124: Hoare triple {139061#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 125: Hoare triple {139061#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 126: Hoare triple {139061#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 127: Hoare triple {139061#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 128: Hoare triple {139061#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 129: Hoare triple {139061#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,935 INFO L290 TraceCheckUtils]: 130: Hoare triple {139061#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 131: Hoare triple {139061#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 132: Hoare triple {139061#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 133: Hoare triple {139061#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 134: Hoare triple {139061#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 135: Hoare triple {139061#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 136: Hoare triple {139061#false} assume 4448 == #t~mem58;havoc #t~mem58; {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 137: Hoare triple {139061#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 138: Hoare triple {139061#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 139: Hoare triple {139061#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 140: Hoare triple {139061#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 141: Hoare triple {139061#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 142: Hoare triple {139061#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 143: Hoare triple {139061#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 144: Hoare triple {139061#false} ~skip~0 := 0; {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 145: Hoare triple {139061#false} assume !false; {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 146: Hoare triple {139061#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 147: Hoare triple {139061#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 148: Hoare triple {139061#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,936 INFO L290 TraceCheckUtils]: 149: Hoare triple {139061#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 150: Hoare triple {139061#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 151: Hoare triple {139061#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 152: Hoare triple {139061#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 153: Hoare triple {139061#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 154: Hoare triple {139061#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 155: Hoare triple {139061#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 156: Hoare triple {139061#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 157: Hoare triple {139061#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 158: Hoare triple {139061#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 159: Hoare triple {139061#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 160: Hoare triple {139061#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 161: Hoare triple {139061#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 162: Hoare triple {139061#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 163: Hoare triple {139061#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 164: Hoare triple {139061#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 165: Hoare triple {139061#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,937 INFO L290 TraceCheckUtils]: 166: Hoare triple {139061#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 167: Hoare triple {139061#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 168: Hoare triple {139061#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 169: Hoare triple {139061#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 170: Hoare triple {139061#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 171: Hoare triple {139061#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 172: Hoare triple {139061#false} assume 4512 == #t~mem68;havoc #t~mem68; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 173: Hoare triple {139061#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 174: Hoare triple {139061#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 175: Hoare triple {139061#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 176: Hoare triple {139061#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 177: Hoare triple {139061#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 178: Hoare triple {139061#false} assume !(0 == ~tmp___8~0); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 179: Hoare triple {139061#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 180: Hoare triple {139061#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 181: Hoare triple {139061#false} ~skip~0 := 0; {139061#false} is VALID [2022-04-28 15:21:19,938 INFO L290 TraceCheckUtils]: 182: Hoare triple {139061#false} assume !false; {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 183: Hoare triple {139061#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 184: Hoare triple {139061#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 185: Hoare triple {139061#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 186: Hoare triple {139061#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 187: Hoare triple {139061#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 188: Hoare triple {139061#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 189: Hoare triple {139061#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,939 INFO L290 TraceCheckUtils]: 190: Hoare triple {139061#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,957 INFO L290 TraceCheckUtils]: 191: Hoare triple {139061#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,957 INFO L290 TraceCheckUtils]: 192: Hoare triple {139061#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,957 INFO L290 TraceCheckUtils]: 193: Hoare triple {139061#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,957 INFO L290 TraceCheckUtils]: 194: Hoare triple {139061#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,957 INFO L290 TraceCheckUtils]: 195: Hoare triple {139061#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,958 INFO L290 TraceCheckUtils]: 196: Hoare triple {139061#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {139061#false} is VALID [2022-04-28 15:21:19,958 INFO L290 TraceCheckUtils]: 197: Hoare triple {139061#false} assume 4432 == #t~mem56;havoc #t~mem56; {139061#false} is VALID [2022-04-28 15:21:19,958 INFO L290 TraceCheckUtils]: 198: Hoare triple {139061#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {139061#false} is VALID [2022-04-28 15:21:19,958 INFO L290 TraceCheckUtils]: 199: Hoare triple {139061#false} assume 5 == ~blastFlag~0; {139061#false} is VALID [2022-04-28 15:21:19,958 INFO L290 TraceCheckUtils]: 200: Hoare triple {139061#false} assume !false; {139061#false} is VALID [2022-04-28 15:21:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:21:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:19,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279721959] [2022-04-28 15:21:19,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279721959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:19,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:19,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:19,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:19,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072461399] [2022-04-28 15:21:19,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072461399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:19,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:19,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959109895] [2022-04-28 15:21:19,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:19,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-28 15:21:19,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:19,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:20,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:20,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:20,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:20,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:20,045 INFO L87 Difference]: Start difference. First operand 1901 states and 2758 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:22,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:23,682 INFO L93 Difference]: Finished difference Result 3836 states and 5549 transitions. [2022-04-28 15:21:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:23,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-28 15:21:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-04-28 15:21:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-04-28 15:21:23,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 378 transitions. [2022-04-28 15:21:23,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:24,082 INFO L225 Difference]: With dead ends: 3836 [2022-04-28 15:21:24,083 INFO L226 Difference]: Without dead ends: 1951 [2022-04-28 15:21:24,085 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-28 15:21:24,085 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:24,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 477 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:21:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2022-04-28 15:21:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1901. [2022-04-28 15:21:24,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:24,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1951 states. Second operand has 1901 states, 1896 states have (on average 1.4483122362869199) internal successors, (2746), 1896 states have internal predecessors, (2746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:24,207 INFO L74 IsIncluded]: Start isIncluded. First operand 1951 states. Second operand has 1901 states, 1896 states have (on average 1.4483122362869199) internal successors, (2746), 1896 states have internal predecessors, (2746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:24,208 INFO L87 Difference]: Start difference. First operand 1951 states. Second operand has 1901 states, 1896 states have (on average 1.4483122362869199) internal successors, (2746), 1896 states have internal predecessors, (2746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:24,301 INFO L93 Difference]: Finished difference Result 1951 states and 2803 transitions. [2022-04-28 15:21:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2803 transitions. [2022-04-28 15:21:24,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:24,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:24,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 1901 states, 1896 states have (on average 1.4483122362869199) internal successors, (2746), 1896 states have internal predecessors, (2746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1951 states. [2022-04-28 15:21:24,306 INFO L87 Difference]: Start difference. First operand has 1901 states, 1896 states have (on average 1.4483122362869199) internal successors, (2746), 1896 states have internal predecessors, (2746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1951 states. [2022-04-28 15:21:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:24,401 INFO L93 Difference]: Finished difference Result 1951 states and 2803 transitions. [2022-04-28 15:21:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2803 transitions. [2022-04-28 15:21:24,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:24,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:24,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:24,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1896 states have (on average 1.4483122362869199) internal successors, (2746), 1896 states have internal predecessors, (2746), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2750 transitions. [2022-04-28 15:21:24,549 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2750 transitions. Word has length 201 [2022-04-28 15:21:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:24,550 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 2750 transitions. [2022-04-28 15:21:24,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:24,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1901 states and 2750 transitions. [2022-04-28 15:21:27,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2750 edges. 2750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2750 transitions. [2022-04-28 15:21:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-28 15:21:27,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:27,233 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:21:27,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:21:27,234 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 1 times [2022-04-28 15:21:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:27,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421917972] [2022-04-28 15:21:27,235 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 2 times [2022-04-28 15:21:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:27,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120167759] [2022-04-28 15:21:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:27,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {154455#(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(196, 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); {154448#true} is VALID [2022-04-28 15:21:27,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {154448#true} assume true; {154448#true} is VALID [2022-04-28 15:21:27,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154448#true} {154448#true} #592#return; {154448#true} is VALID [2022-04-28 15:21:27,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {154448#true} call ULTIMATE.init(); {154455#(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-28 15:21:27,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {154455#(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(196, 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); {154448#true} is VALID [2022-04-28 15:21:27,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {154448#true} assume true; {154448#true} is VALID [2022-04-28 15:21:27,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154448#true} {154448#true} #592#return; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {154448#true} call #t~ret159 := main(); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {154448#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {154448#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {154448#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {154448#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {154448#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {154448#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {154448#true} assume 12292 == #t~mem43;havoc #t~mem43; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {154448#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {154448#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {154448#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {154448#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {154448#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {154448#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {154448#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {154448#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {154448#true} is VALID [2022-04-28 15:21:27,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {154448#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {154448#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {154448#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {154448#true} ~skip~0 := 0; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {154448#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {154448#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {154448#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {154448#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {154448#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {154448#true} assume 4368 == #t~mem48;havoc #t~mem48; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {154448#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {154448#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {154448#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {154448#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {154448#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {154448#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {154448#true} ~skip~0 := 0; {154448#true} is VALID [2022-04-28 15:21:27,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {154448#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {154448#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {154448#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {154448#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {154448#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {154448#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {154448#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {154448#true} assume 4384 == #t~mem50;havoc #t~mem50; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {154448#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {154448#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {154448#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 54: Hoare triple {154448#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {154448#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {154448#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {154448#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {154448#true} ~skip~0 := 0; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {154448#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {154448#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 63: Hoare triple {154448#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 64: Hoare triple {154448#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {154448#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {154448#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {154448#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {154448#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 69: Hoare triple {154448#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {154448#true} assume 4400 == #t~mem52;havoc #t~mem52; {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 71: Hoare triple {154448#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {154448#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 73: Hoare triple {154448#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 74: Hoare triple {154448#true} assume !(~ret~0 <= 0); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {154448#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {154448#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {154448#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 78: Hoare triple {154448#true} ~skip~0 := 0; {154448#true} is VALID [2022-04-28 15:21:27,433 INFO L290 TraceCheckUtils]: 79: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 80: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 81: Hoare triple {154448#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 82: Hoare triple {154448#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 83: Hoare triple {154448#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {154448#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {154448#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {154448#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {154448#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {154448#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 89: Hoare triple {154448#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 90: Hoare triple {154448#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {154448#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {154448#true} assume 4416 == #t~mem54;havoc #t~mem54; {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {154448#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 94: Hoare triple {154448#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 95: Hoare triple {154448#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 96: Hoare triple {154448#true} assume !(0 == ~tmp___6~0); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 97: Hoare triple {154448#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 98: Hoare triple {154448#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154448#true} is VALID [2022-04-28 15:21:27,434 INFO L290 TraceCheckUtils]: 99: Hoare triple {154448#true} ~skip~0 := 0; {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 100: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 101: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 102: Hoare triple {154448#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 103: Hoare triple {154448#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 104: Hoare triple {154448#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 105: Hoare triple {154448#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 106: Hoare triple {154448#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 107: Hoare triple {154448#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 108: Hoare triple {154448#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 109: Hoare triple {154448#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 110: Hoare triple {154448#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 111: Hoare triple {154448#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 112: Hoare triple {154448#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 113: Hoare triple {154448#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 114: Hoare triple {154448#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 115: Hoare triple {154448#true} assume 4432 == #t~mem56;havoc #t~mem56; {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 116: Hoare triple {154448#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {154448#true} is VALID [2022-04-28 15:21:27,435 INFO L290 TraceCheckUtils]: 117: Hoare triple {154448#true} assume !(5 == ~blastFlag~0); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 118: Hoare triple {154448#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 119: Hoare triple {154448#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 120: Hoare triple {154448#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 121: Hoare triple {154448#true} ~skip~0 := 0; {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 122: Hoare triple {154448#true} assume !false; {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 123: Hoare triple {154448#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 124: Hoare triple {154448#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 125: Hoare triple {154448#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 126: Hoare triple {154448#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 127: Hoare triple {154448#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 128: Hoare triple {154448#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 129: Hoare triple {154448#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 130: Hoare triple {154448#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 131: Hoare triple {154448#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 132: Hoare triple {154448#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 133: Hoare triple {154448#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 134: Hoare triple {154448#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 135: Hoare triple {154448#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,436 INFO L290 TraceCheckUtils]: 136: Hoare triple {154448#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,437 INFO L290 TraceCheckUtils]: 137: Hoare triple {154448#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,437 INFO L290 TraceCheckUtils]: 138: Hoare triple {154448#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,437 INFO L290 TraceCheckUtils]: 139: Hoare triple {154448#true} assume 4448 == #t~mem58;havoc #t~mem58; {154448#true} is VALID [2022-04-28 15:21:27,437 INFO L290 TraceCheckUtils]: 140: Hoare triple {154448#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {154448#true} is VALID [2022-04-28 15:21:27,437 INFO L290 TraceCheckUtils]: 141: Hoare triple {154448#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {154448#true} is VALID [2022-04-28 15:21:27,437 INFO L290 TraceCheckUtils]: 142: Hoare triple {154448#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {154448#true} is VALID [2022-04-28 15:21:27,438 INFO L290 TraceCheckUtils]: 143: Hoare triple {154448#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,438 INFO L290 TraceCheckUtils]: 144: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,439 INFO L290 TraceCheckUtils]: 145: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,439 INFO L290 TraceCheckUtils]: 146: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,439 INFO L290 TraceCheckUtils]: 147: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,440 INFO L290 TraceCheckUtils]: 148: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,440 INFO L290 TraceCheckUtils]: 149: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,440 INFO L290 TraceCheckUtils]: 150: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,441 INFO L290 TraceCheckUtils]: 151: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,441 INFO L290 TraceCheckUtils]: 152: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,441 INFO L290 TraceCheckUtils]: 153: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,441 INFO L290 TraceCheckUtils]: 154: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,442 INFO L290 TraceCheckUtils]: 155: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,442 INFO L290 TraceCheckUtils]: 156: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,442 INFO L290 TraceCheckUtils]: 157: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,443 INFO L290 TraceCheckUtils]: 158: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,443 INFO L290 TraceCheckUtils]: 159: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,443 INFO L290 TraceCheckUtils]: 160: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,444 INFO L290 TraceCheckUtils]: 161: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,444 INFO L290 TraceCheckUtils]: 162: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,444 INFO L290 TraceCheckUtils]: 163: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,445 INFO L290 TraceCheckUtils]: 164: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,445 INFO L290 TraceCheckUtils]: 165: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:27,445 INFO L290 TraceCheckUtils]: 166: Hoare triple {154453#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {154454#(= |ssl3_connect_#t~mem60| 4464)} is VALID [2022-04-28 15:21:27,445 INFO L290 TraceCheckUtils]: 167: Hoare triple {154454#(= |ssl3_connect_#t~mem60| 4464)} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 168: Hoare triple {154449#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 169: Hoare triple {154449#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 170: Hoare triple {154449#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 171: Hoare triple {154449#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 172: Hoare triple {154449#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 173: Hoare triple {154449#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 174: Hoare triple {154449#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 175: Hoare triple {154449#false} assume 4512 == #t~mem68;havoc #t~mem68; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 176: Hoare triple {154449#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 177: Hoare triple {154449#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 178: Hoare triple {154449#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 179: Hoare triple {154449#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 180: Hoare triple {154449#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 181: Hoare triple {154449#false} assume !(0 == ~tmp___8~0); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 182: Hoare triple {154449#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 183: Hoare triple {154449#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 184: Hoare triple {154449#false} ~skip~0 := 0; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 185: Hoare triple {154449#false} assume !false; {154449#false} is VALID [2022-04-28 15:21:27,446 INFO L290 TraceCheckUtils]: 186: Hoare triple {154449#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 187: Hoare triple {154449#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 188: Hoare triple {154449#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 189: Hoare triple {154449#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 190: Hoare triple {154449#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 191: Hoare triple {154449#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 192: Hoare triple {154449#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 193: Hoare triple {154449#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 194: Hoare triple {154449#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 195: Hoare triple {154449#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 196: Hoare triple {154449#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 197: Hoare triple {154449#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 198: Hoare triple {154449#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 199: Hoare triple {154449#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 200: Hoare triple {154449#false} assume 4432 == #t~mem56;havoc #t~mem56; {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 201: Hoare triple {154449#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 202: Hoare triple {154449#false} assume 5 == ~blastFlag~0; {154449#false} is VALID [2022-04-28 15:21:27,447 INFO L290 TraceCheckUtils]: 203: Hoare triple {154449#false} assume !false; {154449#false} is VALID [2022-04-28 15:21:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 15:21:27,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:27,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120167759] [2022-04-28 15:21:27,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120167759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:27,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:27,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:27,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421917972] [2022-04-28 15:21:27,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421917972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:27,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:27,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610868947] [2022-04-28 15:21:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 204 [2022-04-28 15:21:27,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:27,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:27,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:27,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:27,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:27,539 INFO L87 Difference]: Start difference. First operand 1901 states and 2750 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:29,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:31,534 INFO L93 Difference]: Finished difference Result 4196 states and 6030 transitions. [2022-04-28 15:21:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:31,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 204 [2022-04-28 15:21:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2022-04-28 15:21:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2022-04-28 15:21:31,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 415 transitions. [2022-04-28 15:21:31,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:32,039 INFO L225 Difference]: With dead ends: 4196 [2022-04-28 15:21:32,039 INFO L226 Difference]: Without dead ends: 2311 [2022-04-28 15:21:32,041 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-28 15:21:32,041 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 41 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:32,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 512 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 422 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:21:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-04-28 15:21:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2133. [2022-04-28 15:21:32,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:32,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2311 states. Second operand has 2133 states, 2128 states have (on average 1.4445488721804511) internal successors, (3074), 2128 states have internal predecessors, (3074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:32,160 INFO L74 IsIncluded]: Start isIncluded. First operand 2311 states. Second operand has 2133 states, 2128 states have (on average 1.4445488721804511) internal successors, (3074), 2128 states have internal predecessors, (3074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:32,161 INFO L87 Difference]: Start difference. First operand 2311 states. Second operand has 2133 states, 2128 states have (on average 1.4445488721804511) internal successors, (3074), 2128 states have internal predecessors, (3074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:32,320 INFO L93 Difference]: Finished difference Result 2311 states and 3292 transitions. [2022-04-28 15:21:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3292 transitions. [2022-04-28 15:21:32,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:32,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:32,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 2133 states, 2128 states have (on average 1.4445488721804511) internal successors, (3074), 2128 states have internal predecessors, (3074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2311 states. [2022-04-28 15:21:32,326 INFO L87 Difference]: Start difference. First operand has 2133 states, 2128 states have (on average 1.4445488721804511) internal successors, (3074), 2128 states have internal predecessors, (3074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2311 states. [2022-04-28 15:21:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:32,465 INFO L93 Difference]: Finished difference Result 2311 states and 3292 transitions. [2022-04-28 15:21:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3292 transitions. [2022-04-28 15:21:32,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:32,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:32,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:32,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2128 states have (on average 1.4445488721804511) internal successors, (3074), 2128 states have internal predecessors, (3074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3078 transitions. [2022-04-28 15:21:32,656 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3078 transitions. Word has length 204 [2022-04-28 15:21:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:32,656 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 3078 transitions. [2022-04-28 15:21:32,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:32,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2133 states and 3078 transitions. [2022-04-28 15:21:35,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3078 edges. 3078 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3078 transitions. [2022-04-28 15:21:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-28 15:21:35,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:35,679 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:21:35,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:21:35,680 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 958358629, now seen corresponding path program 1 times [2022-04-28 15:21:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883858344] [2022-04-28 15:21:35,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 958358629, now seen corresponding path program 2 times [2022-04-28 15:21:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:35,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551899419] [2022-04-28 15:21:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:35,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {171747#(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(196, 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); {171740#true} is VALID [2022-04-28 15:21:35,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {171740#true} assume true; {171740#true} is VALID [2022-04-28 15:21:35,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171740#true} {171740#true} #592#return; {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {171740#true} call ULTIMATE.init(); {171747#(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-28 15:21:35,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {171747#(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(196, 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); {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {171740#true} assume true; {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171740#true} {171740#true} #592#return; {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {171740#true} call #t~ret159 := main(); {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {171740#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {171740#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {171740#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {171740#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {171740#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {171740#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {171740#true} is VALID [2022-04-28 15:21:35,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {171740#true} assume 12292 == #t~mem43;havoc #t~mem43; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {171740#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {171740#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {171740#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {171740#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {171740#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {171740#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {171740#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {171740#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {171740#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {171740#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {171740#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {171740#true} ~skip~0 := 0; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {171740#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {171740#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {171740#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {171740#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {171740#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {171740#true} assume 4368 == #t~mem48;havoc #t~mem48; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {171740#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {171740#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {171740#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {171740#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {171740#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {171740#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {171740#true} ~skip~0 := 0; {171740#true} is VALID [2022-04-28 15:21:35,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {171740#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {171740#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {171740#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {171740#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {171740#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {171740#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {171740#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {171740#true} assume 4384 == #t~mem50;havoc #t~mem50; {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {171740#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {171740#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {171740#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 54: Hoare triple {171740#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {171740#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {171740#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {171740#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {171740#true} ~skip~0 := 0; {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {171740#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 62: Hoare triple {171740#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 63: Hoare triple {171740#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 64: Hoare triple {171740#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {171740#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 66: Hoare triple {171740#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {171740#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {171740#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {171740#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 70: Hoare triple {171740#true} assume 4400 == #t~mem52;havoc #t~mem52; {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {171740#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {171740#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {171740#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {171740#true} assume !(~ret~0 <= 0); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {171740#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {171740#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {171740#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {171740#true} ~skip~0 := 0; {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {171740#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {171740#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {171740#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {171740#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {171740#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 86: Hoare triple {171740#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {171740#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 88: Hoare triple {171740#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {171740#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 90: Hoare triple {171740#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 91: Hoare triple {171740#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {171740#true} assume 4416 == #t~mem54;havoc #t~mem54; {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {171740#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {171740#true} is VALID [2022-04-28 15:21:35,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {171740#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {171740#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {171740#true} assume !(0 == ~tmp___6~0); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {171740#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {171740#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {171740#true} ~skip~0 := 0; {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 102: Hoare triple {171740#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 103: Hoare triple {171740#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 104: Hoare triple {171740#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 105: Hoare triple {171740#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 106: Hoare triple {171740#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 107: Hoare triple {171740#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 108: Hoare triple {171740#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 109: Hoare triple {171740#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 110: Hoare triple {171740#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,930 INFO L290 TraceCheckUtils]: 111: Hoare triple {171740#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {171740#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 113: Hoare triple {171740#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 114: Hoare triple {171740#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 115: Hoare triple {171740#true} assume 4432 == #t~mem56;havoc #t~mem56; {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 116: Hoare triple {171740#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 117: Hoare triple {171740#true} assume !(5 == ~blastFlag~0); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 118: Hoare triple {171740#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 119: Hoare triple {171740#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 120: Hoare triple {171740#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 121: Hoare triple {171740#true} ~skip~0 := 0; {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 122: Hoare triple {171740#true} assume !false; {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 123: Hoare triple {171740#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 124: Hoare triple {171740#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 125: Hoare triple {171740#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 126: Hoare triple {171740#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 127: Hoare triple {171740#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 128: Hoare triple {171740#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,931 INFO L290 TraceCheckUtils]: 129: Hoare triple {171740#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 130: Hoare triple {171740#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 131: Hoare triple {171740#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 132: Hoare triple {171740#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 133: Hoare triple {171740#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 134: Hoare triple {171740#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 135: Hoare triple {171740#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 136: Hoare triple {171740#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 137: Hoare triple {171740#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 138: Hoare triple {171740#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 139: Hoare triple {171740#true} assume 4448 == #t~mem58;havoc #t~mem58; {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 140: Hoare triple {171740#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {171740#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {171740#true} is VALID [2022-04-28 15:21:35,932 INFO L290 TraceCheckUtils]: 142: Hoare triple {171740#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {171740#true} is VALID [2022-04-28 15:21:35,933 INFO L290 TraceCheckUtils]: 143: Hoare triple {171740#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,934 INFO L290 TraceCheckUtils]: 144: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,934 INFO L290 TraceCheckUtils]: 145: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,934 INFO L290 TraceCheckUtils]: 146: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,935 INFO L290 TraceCheckUtils]: 147: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} ~skip~0 := 0; {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,935 INFO L290 TraceCheckUtils]: 148: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !false; {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,935 INFO L290 TraceCheckUtils]: 149: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,935 INFO L290 TraceCheckUtils]: 150: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,936 INFO L290 TraceCheckUtils]: 151: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,936 INFO L290 TraceCheckUtils]: 152: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,936 INFO L290 TraceCheckUtils]: 153: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,937 INFO L290 TraceCheckUtils]: 154: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,937 INFO L290 TraceCheckUtils]: 155: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,937 INFO L290 TraceCheckUtils]: 156: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,938 INFO L290 TraceCheckUtils]: 157: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,938 INFO L290 TraceCheckUtils]: 158: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,938 INFO L290 TraceCheckUtils]: 159: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,939 INFO L290 TraceCheckUtils]: 160: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,939 INFO L290 TraceCheckUtils]: 161: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,939 INFO L290 TraceCheckUtils]: 162: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,939 INFO L290 TraceCheckUtils]: 163: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,940 INFO L290 TraceCheckUtils]: 164: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,940 INFO L290 TraceCheckUtils]: 165: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,940 INFO L290 TraceCheckUtils]: 166: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,940 INFO L290 TraceCheckUtils]: 167: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,941 INFO L290 TraceCheckUtils]: 168: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,941 INFO L290 TraceCheckUtils]: 169: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:21:35,941 INFO L290 TraceCheckUtils]: 170: Hoare triple {171745#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {171746#(= |ssl3_connect_#t~mem64| 4480)} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 171: Hoare triple {171746#(= |ssl3_connect_#t~mem64| 4480)} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 172: Hoare triple {171741#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 173: Hoare triple {171741#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 174: Hoare triple {171741#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 175: Hoare triple {171741#false} assume 4512 == #t~mem68;havoc #t~mem68; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 176: Hoare triple {171741#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 177: Hoare triple {171741#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 178: Hoare triple {171741#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 179: Hoare triple {171741#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 180: Hoare triple {171741#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 181: Hoare triple {171741#false} assume !(0 == ~tmp___8~0); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 182: Hoare triple {171741#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 183: Hoare triple {171741#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 184: Hoare triple {171741#false} ~skip~0 := 0; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 185: Hoare triple {171741#false} assume !false; {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 186: Hoare triple {171741#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,942 INFO L290 TraceCheckUtils]: 187: Hoare triple {171741#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 188: Hoare triple {171741#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 189: Hoare triple {171741#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 190: Hoare triple {171741#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 191: Hoare triple {171741#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 192: Hoare triple {171741#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 193: Hoare triple {171741#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 194: Hoare triple {171741#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 195: Hoare triple {171741#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 196: Hoare triple {171741#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 197: Hoare triple {171741#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 198: Hoare triple {171741#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 199: Hoare triple {171741#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 200: Hoare triple {171741#false} assume 4432 == #t~mem56;havoc #t~mem56; {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 201: Hoare triple {171741#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 202: Hoare triple {171741#false} assume 5 == ~blastFlag~0; {171741#false} is VALID [2022-04-28 15:21:35,943 INFO L290 TraceCheckUtils]: 203: Hoare triple {171741#false} assume !false; {171741#false} is VALID [2022-04-28 15:21:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-28 15:21:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551899419] [2022-04-28 15:21:35,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551899419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:35,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:35,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:35,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:35,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883858344] [2022-04-28 15:21:35,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883858344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:35,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:35,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513226489] [2022-04-28 15:21:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 204 [2022-04-28 15:21:35,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:35,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:36,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:36,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:36,054 INFO L87 Difference]: Start difference. First operand 2133 states and 3078 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:38,080 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-28 15:21:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:40,336 INFO L93 Difference]: Finished difference Result 4819 states and 6926 transitions. [2022-04-28 15:21:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:40,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 204 [2022-04-28 15:21:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:21:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:21:40,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 15:21:40,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:40,957 INFO L225 Difference]: With dead ends: 4819 [2022-04-28 15:21:40,957 INFO L226 Difference]: Without dead ends: 2702 [2022-04-28 15:21:40,961 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-28 15:21:40,961 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 47 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:40,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 524 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:21:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2022-04-28 15:21:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2453. [2022-04-28 15:21:41,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:41,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2702 states. Second operand has 2453 states, 2448 states have (on average 1.451797385620915) internal successors, (3554), 2448 states have internal predecessors, (3554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:41,115 INFO L74 IsIncluded]: Start isIncluded. First operand 2702 states. Second operand has 2453 states, 2448 states have (on average 1.451797385620915) internal successors, (3554), 2448 states have internal predecessors, (3554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:41,118 INFO L87 Difference]: Start difference. First operand 2702 states. Second operand has 2453 states, 2448 states have (on average 1.451797385620915) internal successors, (3554), 2448 states have internal predecessors, (3554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:41,297 INFO L93 Difference]: Finished difference Result 2702 states and 3858 transitions. [2022-04-28 15:21:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3858 transitions. [2022-04-28 15:21:41,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:41,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:41,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 2453 states, 2448 states have (on average 1.451797385620915) internal successors, (3554), 2448 states have internal predecessors, (3554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2702 states. [2022-04-28 15:21:41,303 INFO L87 Difference]: Start difference. First operand has 2453 states, 2448 states have (on average 1.451797385620915) internal successors, (3554), 2448 states have internal predecessors, (3554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2702 states. [2022-04-28 15:21:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:41,503 INFO L93 Difference]: Finished difference Result 2702 states and 3858 transitions. [2022-04-28 15:21:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3858 transitions. [2022-04-28 15:21:41,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:41,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:41,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:41,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2448 states have (on average 1.451797385620915) internal successors, (3554), 2448 states have internal predecessors, (3554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3558 transitions. [2022-04-28 15:21:41,787 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3558 transitions. Word has length 204 [2022-04-28 15:21:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:41,787 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3558 transitions. [2022-04-28 15:21:41,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:41,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2453 states and 3558 transitions. [2022-04-28 15:21:45,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3558 edges. 3558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3558 transitions. [2022-04-28 15:21:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-28 15:21:45,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:45,150 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:21:45,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:21:45,150 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 1 times [2022-04-28 15:21:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:45,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850499391] [2022-04-28 15:21:57,921 WARN L232 SmtUtils]: Spent 12.41s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:22:08,677 WARN L232 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:22:16,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 2 times [2022-04-28 15:22:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:16,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395122325] [2022-04-28 15:22:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:16,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {191707#(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(196, 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); {191700#true} is VALID [2022-04-28 15:22:16,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {191700#true} assume true; {191700#true} is VALID [2022-04-28 15:22:16,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191700#true} {191700#true} #592#return; {191700#true} is VALID [2022-04-28 15:22:16,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {191700#true} call ULTIMATE.init(); {191707#(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-28 15:22:16,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {191707#(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(196, 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); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {191700#true} assume true; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191700#true} {191700#true} #592#return; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {191700#true} call #t~ret159 := main(); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {191700#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {191700#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {191700#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {191700#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {191700#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {191700#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {191700#true} assume 12292 == #t~mem43;havoc #t~mem43; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {191700#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {191700#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {191700#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {191700#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {191700#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {191700#true} is VALID [2022-04-28 15:22:16,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {191700#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {191700#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {191700#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {191700#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {191700#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {191700#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {191700#true} ~skip~0 := 0; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {191700#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {191700#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {191700#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {191700#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {191700#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {191700#true} assume 4368 == #t~mem48;havoc #t~mem48; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {191700#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {191700#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {191700#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {191700#true} is VALID [2022-04-28 15:22:16,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {191700#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {191700#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {191700#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {191700#true} ~skip~0 := 0; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {191700#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {191700#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {191700#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {191700#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {191700#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {191700#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {191700#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {191700#true} assume 4384 == #t~mem50;havoc #t~mem50; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {191700#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {191700#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {191700#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {191700#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {191700#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {191700#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {191700#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {191700#true} ~skip~0 := 0; {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {191700#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {191700#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {191700#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 64: Hoare triple {191700#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 65: Hoare triple {191700#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 66: Hoare triple {191700#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 67: Hoare triple {191700#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 68: Hoare triple {191700#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 69: Hoare triple {191700#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 70: Hoare triple {191700#true} assume 4400 == #t~mem52;havoc #t~mem52; {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 71: Hoare triple {191700#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 72: Hoare triple {191700#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 73: Hoare triple {191700#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 74: Hoare triple {191700#true} assume !(~ret~0 <= 0); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 75: Hoare triple {191700#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,515 INFO L290 TraceCheckUtils]: 76: Hoare triple {191700#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {191700#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {191700#true} ~skip~0 := 0; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {191700#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {191700#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 83: Hoare triple {191700#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {191700#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 85: Hoare triple {191700#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {191700#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 87: Hoare triple {191700#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 88: Hoare triple {191700#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 89: Hoare triple {191700#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 90: Hoare triple {191700#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 91: Hoare triple {191700#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 92: Hoare triple {191700#true} assume 4416 == #t~mem54;havoc #t~mem54; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 93: Hoare triple {191700#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 94: Hoare triple {191700#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 95: Hoare triple {191700#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {191700#true} is VALID [2022-04-28 15:22:16,516 INFO L290 TraceCheckUtils]: 96: Hoare triple {191700#true} assume !(0 == ~tmp___6~0); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 97: Hoare triple {191700#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 98: Hoare triple {191700#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 99: Hoare triple {191700#true} ~skip~0 := 0; {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 100: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 101: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 102: Hoare triple {191700#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 103: Hoare triple {191700#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 104: Hoare triple {191700#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 105: Hoare triple {191700#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 106: Hoare triple {191700#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 107: Hoare triple {191700#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 108: Hoare triple {191700#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 109: Hoare triple {191700#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 110: Hoare triple {191700#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 111: Hoare triple {191700#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 112: Hoare triple {191700#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 113: Hoare triple {191700#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 114: Hoare triple {191700#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,517 INFO L290 TraceCheckUtils]: 115: Hoare triple {191700#true} assume 4432 == #t~mem56;havoc #t~mem56; {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 116: Hoare triple {191700#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 117: Hoare triple {191700#true} assume !(5 == ~blastFlag~0); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 118: Hoare triple {191700#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 119: Hoare triple {191700#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 120: Hoare triple {191700#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 121: Hoare triple {191700#true} ~skip~0 := 0; {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {191700#true} assume !false; {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 123: Hoare triple {191700#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 124: Hoare triple {191700#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 125: Hoare triple {191700#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 126: Hoare triple {191700#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 127: Hoare triple {191700#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 128: Hoare triple {191700#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 129: Hoare triple {191700#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 130: Hoare triple {191700#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 131: Hoare triple {191700#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 132: Hoare triple {191700#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 133: Hoare triple {191700#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 134: Hoare triple {191700#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,518 INFO L290 TraceCheckUtils]: 135: Hoare triple {191700#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 136: Hoare triple {191700#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 137: Hoare triple {191700#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 138: Hoare triple {191700#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 139: Hoare triple {191700#true} assume 4448 == #t~mem58;havoc #t~mem58; {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 140: Hoare triple {191700#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 141: Hoare triple {191700#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {191700#true} is VALID [2022-04-28 15:22:16,519 INFO L290 TraceCheckUtils]: 142: Hoare triple {191700#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {191700#true} is VALID [2022-04-28 15:22:16,520 INFO L290 TraceCheckUtils]: 143: Hoare triple {191700#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,520 INFO L290 TraceCheckUtils]: 144: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,521 INFO L290 TraceCheckUtils]: 145: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,521 INFO L290 TraceCheckUtils]: 146: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,521 INFO L290 TraceCheckUtils]: 147: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,521 INFO L290 TraceCheckUtils]: 148: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,522 INFO L290 TraceCheckUtils]: 149: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,522 INFO L290 TraceCheckUtils]: 150: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,522 INFO L290 TraceCheckUtils]: 151: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,523 INFO L290 TraceCheckUtils]: 152: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,523 INFO L290 TraceCheckUtils]: 153: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,523 INFO L290 TraceCheckUtils]: 154: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,523 INFO L290 TraceCheckUtils]: 155: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,524 INFO L290 TraceCheckUtils]: 156: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,524 INFO L290 TraceCheckUtils]: 157: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,524 INFO L290 TraceCheckUtils]: 158: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 159: Hoare triple {191705#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {191706#(= |ssl3_connect_#t~mem53| 4464)} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 160: Hoare triple {191706#(= |ssl3_connect_#t~mem53| 4464)} assume 4401 == #t~mem53;havoc #t~mem53; {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 161: Hoare triple {191701#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 162: Hoare triple {191701#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 163: Hoare triple {191701#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 164: Hoare triple {191701#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 165: Hoare triple {191701#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 166: Hoare triple {191701#false} ~skip~0 := 0; {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 167: Hoare triple {191701#false} assume !false; {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 168: Hoare triple {191701#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 169: Hoare triple {191701#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,525 INFO L290 TraceCheckUtils]: 170: Hoare triple {191701#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 171: Hoare triple {191701#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 172: Hoare triple {191701#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 173: Hoare triple {191701#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 174: Hoare triple {191701#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 175: Hoare triple {191701#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 176: Hoare triple {191701#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 177: Hoare triple {191701#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 178: Hoare triple {191701#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 179: Hoare triple {191701#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 180: Hoare triple {191701#false} assume 4416 == #t~mem54;havoc #t~mem54; {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 181: Hoare triple {191701#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 182: Hoare triple {191701#false} assume !(3 == ~blastFlag~0); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 183: Hoare triple {191701#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 184: Hoare triple {191701#false} assume !(0 == ~tmp___6~0); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 185: Hoare triple {191701#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 186: Hoare triple {191701#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 187: Hoare triple {191701#false} ~skip~0 := 0; {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 188: Hoare triple {191701#false} assume !false; {191701#false} is VALID [2022-04-28 15:22:16,526 INFO L290 TraceCheckUtils]: 189: Hoare triple {191701#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 190: Hoare triple {191701#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 191: Hoare triple {191701#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 192: Hoare triple {191701#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 193: Hoare triple {191701#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 194: Hoare triple {191701#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 195: Hoare triple {191701#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 196: Hoare triple {191701#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 197: Hoare triple {191701#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 198: Hoare triple {191701#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 199: Hoare triple {191701#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 200: Hoare triple {191701#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 201: Hoare triple {191701#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 202: Hoare triple {191701#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 203: Hoare triple {191701#false} assume 4432 == #t~mem56;havoc #t~mem56; {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 204: Hoare triple {191701#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 205: Hoare triple {191701#false} assume 5 == ~blastFlag~0; {191701#false} is VALID [2022-04-28 15:22:16,527 INFO L290 TraceCheckUtils]: 206: Hoare triple {191701#false} assume !false; {191701#false} is VALID [2022-04-28 15:22:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-28 15:22:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:16,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395122325] [2022-04-28 15:22:16,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395122325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:16,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:16,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:16,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:16,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850499391] [2022-04-28 15:22:16,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850499391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:16,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:16,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104950831] [2022-04-28 15:22:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:16,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 207 [2022-04-28 15:22:16,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:16,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:16,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:16,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:16,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:16,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:16,642 INFO L87 Difference]: Start difference. First operand 2453 states and 3558 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:18,664 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-28 15:22:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:20,833 INFO L93 Difference]: Finished difference Result 5030 states and 7262 transitions. [2022-04-28 15:22:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 207 [2022-04-28 15:22:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:22:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:22:20,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-28 15:22:21,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:21,392 INFO L225 Difference]: With dead ends: 5030 [2022-04-28 15:22:21,392 INFO L226 Difference]: Without dead ends: 2593 [2022-04-28 15:22:21,397 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-28 15:22:21,397 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 41 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:21,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 502 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:22:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-04-28 15:22:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2453. [2022-04-28 15:22:21,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:21,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2593 states. Second operand has 2453 states, 2448 states have (on average 1.4485294117647058) internal successors, (3546), 2448 states have internal predecessors, (3546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:21,555 INFO L74 IsIncluded]: Start isIncluded. First operand 2593 states. Second operand has 2453 states, 2448 states have (on average 1.4485294117647058) internal successors, (3546), 2448 states have internal predecessors, (3546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:21,556 INFO L87 Difference]: Start difference. First operand 2593 states. Second operand has 2453 states, 2448 states have (on average 1.4485294117647058) internal successors, (3546), 2448 states have internal predecessors, (3546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:21,731 INFO L93 Difference]: Finished difference Result 2593 states and 3716 transitions. [2022-04-28 15:22:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3716 transitions. [2022-04-28 15:22:21,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:21,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:21,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 2453 states, 2448 states have (on average 1.4485294117647058) internal successors, (3546), 2448 states have internal predecessors, (3546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2593 states. [2022-04-28 15:22:21,738 INFO L87 Difference]: Start difference. First operand has 2453 states, 2448 states have (on average 1.4485294117647058) internal successors, (3546), 2448 states have internal predecessors, (3546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2593 states. [2022-04-28 15:22:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:21,925 INFO L93 Difference]: Finished difference Result 2593 states and 3716 transitions. [2022-04-28 15:22:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3716 transitions. [2022-04-28 15:22:21,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:21,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:21,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:21,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2448 states have (on average 1.4485294117647058) internal successors, (3546), 2448 states have internal predecessors, (3546), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3550 transitions. [2022-04-28 15:22:22,237 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3550 transitions. Word has length 207 [2022-04-28 15:22:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:22,238 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3550 transitions. [2022-04-28 15:22:22,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:22,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2453 states and 3550 transitions. [2022-04-28 15:22:25,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3550 edges. 3550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3550 transitions. [2022-04-28 15:22:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-28 15:22:25,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:25,628 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:22:25,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:22:25,628 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1263279424, now seen corresponding path program 1 times [2022-04-28 15:22:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:25,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687207418] [2022-04-28 15:22:37,412 WARN L232 SmtUtils]: Spent 11.42s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:22:47,639 WARN L232 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:22:55,334 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1263279424, now seen corresponding path program 2 times [2022-04-28 15:22:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:55,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109977946] [2022-04-28 15:22:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:55,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {211871#(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(196, 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); {211864#true} is VALID [2022-04-28 15:22:55,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {211864#true} assume true; {211864#true} is VALID [2022-04-28 15:22:55,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {211864#true} {211864#true} #592#return; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {211864#true} call ULTIMATE.init(); {211871#(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-28 15:22:55,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {211871#(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(196, 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); {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {211864#true} assume true; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211864#true} {211864#true} #592#return; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {211864#true} call #t~ret159 := main(); {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {211864#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {211864#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {211864#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {211864#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {211864#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {211864#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {211864#true} assume 12292 == #t~mem43;havoc #t~mem43; {211864#true} is VALID [2022-04-28 15:22:55,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {211864#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {211864#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {211864#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {211864#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {211864#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {211864#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {211864#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {211864#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {211864#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {211864#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {211864#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {211864#true} ~skip~0 := 0; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {211864#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {211864#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {211864#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {211864#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {211864#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {211864#true} assume 4368 == #t~mem48;havoc #t~mem48; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {211864#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {211864#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {211864#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {211864#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {211864#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {211864#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {211864#true} ~skip~0 := 0; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {211864#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {211864#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {211864#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {211864#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {211864#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {211864#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {211864#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {211864#true} assume 4384 == #t~mem50;havoc #t~mem50; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {211864#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {211864#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {211864#true} is VALID [2022-04-28 15:22:55,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {211864#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {211864#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {211864#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {211864#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {211864#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {211864#true} ~skip~0 := 0; {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {211864#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {211864#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {211864#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 64: Hoare triple {211864#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 65: Hoare triple {211864#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 66: Hoare triple {211864#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 67: Hoare triple {211864#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 68: Hoare triple {211864#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 69: Hoare triple {211864#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 70: Hoare triple {211864#true} assume 4400 == #t~mem52;havoc #t~mem52; {211864#true} is VALID [2022-04-28 15:22:55,515 INFO L290 TraceCheckUtils]: 71: Hoare triple {211864#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {211864#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {211864#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {211864#true} assume !(~ret~0 <= 0); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {211864#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {211864#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {211864#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {211864#true} ~skip~0 := 0; {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {211864#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {211864#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 83: Hoare triple {211864#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 84: Hoare triple {211864#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 85: Hoare triple {211864#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {211864#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 87: Hoare triple {211864#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 88: Hoare triple {211864#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 89: Hoare triple {211864#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,516 INFO L290 TraceCheckUtils]: 90: Hoare triple {211864#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {211864#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {211864#true} assume 4416 == #t~mem54;havoc #t~mem54; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 93: Hoare triple {211864#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 94: Hoare triple {211864#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 95: Hoare triple {211864#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 96: Hoare triple {211864#true} assume !(0 == ~tmp___6~0); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 97: Hoare triple {211864#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 98: Hoare triple {211864#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 99: Hoare triple {211864#true} ~skip~0 := 0; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 100: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 101: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 102: Hoare triple {211864#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 103: Hoare triple {211864#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 104: Hoare triple {211864#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 105: Hoare triple {211864#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 106: Hoare triple {211864#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 107: Hoare triple {211864#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 108: Hoare triple {211864#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,517 INFO L290 TraceCheckUtils]: 109: Hoare triple {211864#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 110: Hoare triple {211864#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 111: Hoare triple {211864#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 112: Hoare triple {211864#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {211864#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 114: Hoare triple {211864#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 115: Hoare triple {211864#true} assume 4432 == #t~mem56;havoc #t~mem56; {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 116: Hoare triple {211864#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 117: Hoare triple {211864#true} assume !(5 == ~blastFlag~0); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 118: Hoare triple {211864#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 119: Hoare triple {211864#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 120: Hoare triple {211864#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 121: Hoare triple {211864#true} ~skip~0 := 0; {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {211864#true} assume !false; {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 123: Hoare triple {211864#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 124: Hoare triple {211864#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 125: Hoare triple {211864#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 126: Hoare triple {211864#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 127: Hoare triple {211864#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,518 INFO L290 TraceCheckUtils]: 128: Hoare triple {211864#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 129: Hoare triple {211864#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 130: Hoare triple {211864#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 131: Hoare triple {211864#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 132: Hoare triple {211864#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 133: Hoare triple {211864#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 134: Hoare triple {211864#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 135: Hoare triple {211864#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 136: Hoare triple {211864#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 137: Hoare triple {211864#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 138: Hoare triple {211864#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 139: Hoare triple {211864#true} assume 4448 == #t~mem58;havoc #t~mem58; {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 140: Hoare triple {211864#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 141: Hoare triple {211864#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {211864#true} is VALID [2022-04-28 15:22:55,519 INFO L290 TraceCheckUtils]: 142: Hoare triple {211864#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {211864#true} is VALID [2022-04-28 15:22:55,520 INFO L290 TraceCheckUtils]: 143: Hoare triple {211864#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,521 INFO L290 TraceCheckUtils]: 144: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,521 INFO L290 TraceCheckUtils]: 145: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,521 INFO L290 TraceCheckUtils]: 146: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,521 INFO L290 TraceCheckUtils]: 147: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} ~skip~0 := 0; {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,522 INFO L290 TraceCheckUtils]: 148: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !false; {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,522 INFO L290 TraceCheckUtils]: 149: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,522 INFO L290 TraceCheckUtils]: 150: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,522 INFO L290 TraceCheckUtils]: 151: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,523 INFO L290 TraceCheckUtils]: 152: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,523 INFO L290 TraceCheckUtils]: 153: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,523 INFO L290 TraceCheckUtils]: 154: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,523 INFO L290 TraceCheckUtils]: 155: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,524 INFO L290 TraceCheckUtils]: 156: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,524 INFO L290 TraceCheckUtils]: 157: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,524 INFO L290 TraceCheckUtils]: 158: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 159: Hoare triple {211869#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {211870#(= |ssl3_connect_#t~mem53| 4480)} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 160: Hoare triple {211870#(= |ssl3_connect_#t~mem53| 4480)} assume 4401 == #t~mem53;havoc #t~mem53; {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 161: Hoare triple {211865#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 162: Hoare triple {211865#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 163: Hoare triple {211865#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 164: Hoare triple {211865#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 165: Hoare triple {211865#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 166: Hoare triple {211865#false} ~skip~0 := 0; {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 167: Hoare triple {211865#false} assume !false; {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 168: Hoare triple {211865#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 169: Hoare triple {211865#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 170: Hoare triple {211865#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,525 INFO L290 TraceCheckUtils]: 171: Hoare triple {211865#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 172: Hoare triple {211865#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 173: Hoare triple {211865#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 174: Hoare triple {211865#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 175: Hoare triple {211865#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 176: Hoare triple {211865#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 177: Hoare triple {211865#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 178: Hoare triple {211865#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 179: Hoare triple {211865#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 180: Hoare triple {211865#false} assume 4416 == #t~mem54;havoc #t~mem54; {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 181: Hoare triple {211865#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 182: Hoare triple {211865#false} assume !(3 == ~blastFlag~0); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 183: Hoare triple {211865#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 184: Hoare triple {211865#false} assume !(0 == ~tmp___6~0); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 185: Hoare triple {211865#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 186: Hoare triple {211865#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 187: Hoare triple {211865#false} ~skip~0 := 0; {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 188: Hoare triple {211865#false} assume !false; {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 189: Hoare triple {211865#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 190: Hoare triple {211865#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,526 INFO L290 TraceCheckUtils]: 191: Hoare triple {211865#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 192: Hoare triple {211865#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 193: Hoare triple {211865#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 194: Hoare triple {211865#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 195: Hoare triple {211865#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 196: Hoare triple {211865#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 197: Hoare triple {211865#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 198: Hoare triple {211865#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 199: Hoare triple {211865#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 200: Hoare triple {211865#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 201: Hoare triple {211865#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 202: Hoare triple {211865#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 203: Hoare triple {211865#false} assume 4432 == #t~mem56;havoc #t~mem56; {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 204: Hoare triple {211865#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 205: Hoare triple {211865#false} assume 5 == ~blastFlag~0; {211865#false} is VALID [2022-04-28 15:22:55,527 INFO L290 TraceCheckUtils]: 206: Hoare triple {211865#false} assume !false; {211865#false} is VALID [2022-04-28 15:22:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-28 15:22:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:55,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109977946] [2022-04-28 15:22:55,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109977946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:55,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:55,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:55,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:55,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687207418] [2022-04-28 15:22:55,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687207418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:55,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:55,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475004641] [2022-04-28 15:22:55,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:55,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 207 [2022-04-28 15:22:55,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:55,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:55,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:55,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:55,624 INFO L87 Difference]: Start difference. First operand 2453 states and 3550 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:57,644 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-28 15:23:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:00,016 INFO L93 Difference]: Finished difference Result 5091 states and 7320 transitions. [2022-04-28 15:23:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:00,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 207 [2022-04-28 15:23:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2022-04-28 15:23:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2022-04-28 15:23:00,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 419 transitions. [2022-04-28 15:23:00,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:00,570 INFO L225 Difference]: With dead ends: 5091 [2022-04-28 15:23:00,570 INFO L226 Difference]: Without dead ends: 2654 [2022-04-28 15:23:00,573 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-28 15:23:00,573 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 51 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:00,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 514 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 434 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:23:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2022-04-28 15:23:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2453. [2022-04-28 15:23:00,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:00,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2654 states. Second operand has 2453 states, 2448 states have (on average 1.4444444444444444) internal successors, (3536), 2448 states have internal predecessors, (3536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:00,728 INFO L74 IsIncluded]: Start isIncluded. First operand 2654 states. Second operand has 2453 states, 2448 states have (on average 1.4444444444444444) internal successors, (3536), 2448 states have internal predecessors, (3536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:00,729 INFO L87 Difference]: Start difference. First operand 2654 states. Second operand has 2453 states, 2448 states have (on average 1.4444444444444444) internal successors, (3536), 2448 states have internal predecessors, (3536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:00,916 INFO L93 Difference]: Finished difference Result 2654 states and 3780 transitions. [2022-04-28 15:23:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3780 transitions. [2022-04-28 15:23:00,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:00,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:00,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 2453 states, 2448 states have (on average 1.4444444444444444) internal successors, (3536), 2448 states have internal predecessors, (3536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2654 states. [2022-04-28 15:23:00,923 INFO L87 Difference]: Start difference. First operand has 2453 states, 2448 states have (on average 1.4444444444444444) internal successors, (3536), 2448 states have internal predecessors, (3536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2654 states. [2022-04-28 15:23:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:01,092 INFO L93 Difference]: Finished difference Result 2654 states and 3780 transitions. [2022-04-28 15:23:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3780 transitions. [2022-04-28 15:23:01,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:01,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:01,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:01,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2448 states have (on average 1.4444444444444444) internal successors, (3536), 2448 states have internal predecessors, (3536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3540 transitions. [2022-04-28 15:23:01,354 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3540 transitions. Word has length 207 [2022-04-28 15:23:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:01,355 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3540 transitions. [2022-04-28 15:23:01,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:01,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2453 states and 3540 transitions. [2022-04-28 15:23:04,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3540 edges. 3540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3540 transitions. [2022-04-28 15:23:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-04-28 15:23:04,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:04,838 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:23:04,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:23:04,838 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:04,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1538011467, now seen corresponding path program 1 times [2022-04-28 15:23:04,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:04,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599575302] [2022-04-28 15:23:10,147 WARN L232 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 203 DAG size of output: 192 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:23:28,455 WARN L232 SmtUtils]: Spent 13.89s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:23:39,696 WARN L232 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:23:42,525 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1538011467, now seen corresponding path program 2 times [2022-04-28 15:23:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:42,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158078575] [2022-04-28 15:23:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:42,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {232279#(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(196, 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); {232272#true} is VALID [2022-04-28 15:23:42,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {232272#true} assume true; {232272#true} is VALID [2022-04-28 15:23:42,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232272#true} {232272#true} #592#return; {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {232272#true} call ULTIMATE.init(); {232279#(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-28 15:23:42,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {232279#(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(196, 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); {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {232272#true} assume true; {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232272#true} {232272#true} #592#return; {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {232272#true} call #t~ret159 := main(); {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {232272#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {232272#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {232272#true} is VALID [2022-04-28 15:23:42,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {232272#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {232272#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {232272#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {232272#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {232272#true} assume 12292 == #t~mem43;havoc #t~mem43; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {232272#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {232272#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {232272#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {232272#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {232272#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {232272#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {232272#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {232272#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {232272#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {232272#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {232272#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {232272#true} ~skip~0 := 0; {232272#true} is VALID [2022-04-28 15:23:42,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {232272#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {232272#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {232272#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {232272#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {232272#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {232272#true} assume 4368 == #t~mem48;havoc #t~mem48; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {232272#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {232272#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {232272#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {232272#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {232272#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {232272#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {232272#true} ~skip~0 := 0; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {232272#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {232272#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {232272#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {232272#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {232272#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {232272#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {232272#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {232272#true} assume 4384 == #t~mem50;havoc #t~mem50; {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {232272#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {232272#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {232272#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {232272#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {232272#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {232272#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {232272#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {232272#true} ~skip~0 := 0; {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {232272#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {232272#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {232272#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {232272#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {232272#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {232272#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {232272#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {232272#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {232272#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {232272#true} assume 4400 == #t~mem52;havoc #t~mem52; {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {232272#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {232272#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {232272#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {232272#true} assume !(~ret~0 <= 0); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {232272#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {232272#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {232272#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {232272#true} ~skip~0 := 0; {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 79: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 81: Hoare triple {232272#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 82: Hoare triple {232272#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 83: Hoare triple {232272#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 84: Hoare triple {232272#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,734 INFO L290 TraceCheckUtils]: 85: Hoare triple {232272#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 86: Hoare triple {232272#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 87: Hoare triple {232272#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {232272#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 89: Hoare triple {232272#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 90: Hoare triple {232272#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 91: Hoare triple {232272#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {232272#true} assume 4416 == #t~mem54;havoc #t~mem54; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {232272#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 94: Hoare triple {232272#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 95: Hoare triple {232272#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 96: Hoare triple {232272#true} assume !(0 == ~tmp___6~0); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 97: Hoare triple {232272#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 98: Hoare triple {232272#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {232272#true} ~skip~0 := 0; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 101: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 102: Hoare triple {232272#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 103: Hoare triple {232272#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,735 INFO L290 TraceCheckUtils]: 104: Hoare triple {232272#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 105: Hoare triple {232272#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 106: Hoare triple {232272#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 107: Hoare triple {232272#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 108: Hoare triple {232272#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 109: Hoare triple {232272#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 110: Hoare triple {232272#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 111: Hoare triple {232272#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {232272#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 113: Hoare triple {232272#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 114: Hoare triple {232272#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 115: Hoare triple {232272#true} assume 4432 == #t~mem56;havoc #t~mem56; {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {232272#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 117: Hoare triple {232272#true} assume !(5 == ~blastFlag~0); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 118: Hoare triple {232272#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {232272#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 120: Hoare triple {232272#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {232272#true} ~skip~0 := 0; {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 122: Hoare triple {232272#true} assume !false; {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 123: Hoare triple {232272#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,736 INFO L290 TraceCheckUtils]: 124: Hoare triple {232272#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 125: Hoare triple {232272#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 126: Hoare triple {232272#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {232272#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {232272#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {232272#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {232272#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 131: Hoare triple {232272#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 132: Hoare triple {232272#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 133: Hoare triple {232272#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 134: Hoare triple {232272#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 135: Hoare triple {232272#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 136: Hoare triple {232272#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 137: Hoare triple {232272#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 138: Hoare triple {232272#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 139: Hoare triple {232272#true} assume 4448 == #t~mem58;havoc #t~mem58; {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 140: Hoare triple {232272#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 141: Hoare triple {232272#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {232272#true} is VALID [2022-04-28 15:23:42,737 INFO L290 TraceCheckUtils]: 142: Hoare triple {232272#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {232272#true} is VALID [2022-04-28 15:23:42,738 INFO L290 TraceCheckUtils]: 143: Hoare triple {232272#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,739 INFO L290 TraceCheckUtils]: 144: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,739 INFO L290 TraceCheckUtils]: 145: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,739 INFO L290 TraceCheckUtils]: 146: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,740 INFO L290 TraceCheckUtils]: 147: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,740 INFO L290 TraceCheckUtils]: 148: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,740 INFO L290 TraceCheckUtils]: 149: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,741 INFO L290 TraceCheckUtils]: 150: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,741 INFO L290 TraceCheckUtils]: 151: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,741 INFO L290 TraceCheckUtils]: 152: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 153: Hoare triple {232277#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232278#(= |ssl3_connect_#t~mem47| 4464)} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 154: Hoare triple {232278#(= |ssl3_connect_#t~mem47| 4464)} assume 4099 == #t~mem47;havoc #t~mem47; {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 155: Hoare triple {232273#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 156: Hoare triple {232273#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 157: Hoare triple {232273#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 158: Hoare triple {232273#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 159: Hoare triple {232273#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 160: Hoare triple {232273#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 161: Hoare triple {232273#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 162: Hoare triple {232273#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 163: Hoare triple {232273#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 164: Hoare triple {232273#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232273#false} is VALID [2022-04-28 15:23:42,742 INFO L290 TraceCheckUtils]: 165: Hoare triple {232273#false} ~skip~0 := 0; {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 166: Hoare triple {232273#false} assume !false; {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 167: Hoare triple {232273#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 168: Hoare triple {232273#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 169: Hoare triple {232273#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 170: Hoare triple {232273#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 171: Hoare triple {232273#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 172: Hoare triple {232273#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 173: Hoare triple {232273#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 174: Hoare triple {232273#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 175: Hoare triple {232273#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 176: Hoare triple {232273#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 177: Hoare triple {232273#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 178: Hoare triple {232273#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 179: Hoare triple {232273#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 180: Hoare triple {232273#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 181: Hoare triple {232273#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,743 INFO L290 TraceCheckUtils]: 182: Hoare triple {232273#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 183: Hoare triple {232273#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 184: Hoare triple {232273#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 185: Hoare triple {232273#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 186: Hoare triple {232273#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 187: Hoare triple {232273#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 188: Hoare triple {232273#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 189: Hoare triple {232273#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 190: Hoare triple {232273#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 191: Hoare triple {232273#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 192: Hoare triple {232273#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 193: Hoare triple {232273#false} assume 4512 == #t~mem68;havoc #t~mem68; {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 194: Hoare triple {232273#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 195: Hoare triple {232273#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 196: Hoare triple {232273#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {232273#false} is VALID [2022-04-28 15:23:42,744 INFO L290 TraceCheckUtils]: 197: Hoare triple {232273#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 198: Hoare triple {232273#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 199: Hoare triple {232273#false} assume !(0 == ~tmp___8~0); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 200: Hoare triple {232273#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 201: Hoare triple {232273#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 202: Hoare triple {232273#false} ~skip~0 := 0; {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 203: Hoare triple {232273#false} assume !false; {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 204: Hoare triple {232273#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 205: Hoare triple {232273#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 206: Hoare triple {232273#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 207: Hoare triple {232273#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 208: Hoare triple {232273#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 209: Hoare triple {232273#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 210: Hoare triple {232273#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 211: Hoare triple {232273#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,745 INFO L290 TraceCheckUtils]: 212: Hoare triple {232273#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 213: Hoare triple {232273#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 214: Hoare triple {232273#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 215: Hoare triple {232273#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 216: Hoare triple {232273#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 217: Hoare triple {232273#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 218: Hoare triple {232273#false} assume 4432 == #t~mem56;havoc #t~mem56; {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 219: Hoare triple {232273#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 220: Hoare triple {232273#false} assume 5 == ~blastFlag~0; {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L290 TraceCheckUtils]: 221: Hoare triple {232273#false} assume !false; {232273#false} is VALID [2022-04-28 15:23:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-04-28 15:23:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158078575] [2022-04-28 15:23:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158078575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:42,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599575302] [2022-04-28 15:23:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599575302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709172458] [2022-04-28 15:23:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 222 [2022-04-28 15:23:42,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:42,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:42,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:42,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:42,842 INFO L87 Difference]: Start difference. First operand 2453 states and 3540 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:44,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:46,937 INFO L93 Difference]: Finished difference Result 4994 states and 7182 transitions. [2022-04-28 15:23:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:46,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 222 [2022-04-28 15:23:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 395 transitions. [2022-04-28 15:23:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 395 transitions. [2022-04-28 15:23:46,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 395 transitions. [2022-04-28 15:23:47,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:47,489 INFO L225 Difference]: With dead ends: 4994 [2022-04-28 15:23:47,489 INFO L226 Difference]: Without dead ends: 2557 [2022-04-28 15:23:47,491 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-28 15:23:47,492 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 39 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:47,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 488 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:23:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2022-04-28 15:23:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2453. [2022-04-28 15:23:47,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:47,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2557 states. Second operand has 2453 states, 2448 states have (on average 1.4411764705882353) internal successors, (3528), 2448 states have internal predecessors, (3528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:47,646 INFO L74 IsIncluded]: Start isIncluded. First operand 2557 states. Second operand has 2453 states, 2448 states have (on average 1.4411764705882353) internal successors, (3528), 2448 states have internal predecessors, (3528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:47,648 INFO L87 Difference]: Start difference. First operand 2557 states. Second operand has 2453 states, 2448 states have (on average 1.4411764705882353) internal successors, (3528), 2448 states have internal predecessors, (3528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:47,801 INFO L93 Difference]: Finished difference Result 2557 states and 3654 transitions. [2022-04-28 15:23:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3654 transitions. [2022-04-28 15:23:47,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:47,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:47,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 2453 states, 2448 states have (on average 1.4411764705882353) internal successors, (3528), 2448 states have internal predecessors, (3528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2557 states. [2022-04-28 15:23:47,807 INFO L87 Difference]: Start difference. First operand has 2453 states, 2448 states have (on average 1.4411764705882353) internal successors, (3528), 2448 states have internal predecessors, (3528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2557 states. [2022-04-28 15:23:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:47,965 INFO L93 Difference]: Finished difference Result 2557 states and 3654 transitions. [2022-04-28 15:23:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3654 transitions. [2022-04-28 15:23:47,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:47,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:47,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:47,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2448 states have (on average 1.4411764705882353) internal successors, (3528), 2448 states have internal predecessors, (3528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3532 transitions. [2022-04-28 15:23:48,211 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3532 transitions. Word has length 222 [2022-04-28 15:23:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:48,211 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3532 transitions. [2022-04-28 15:23:48,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:48,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2453 states and 3532 transitions. [2022-04-28 15:23:51,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3532 edges. 3532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3532 transitions. [2022-04-28 15:23:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-04-28 15:23:51,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:51,629 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:23:51,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:23:51,629 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1778251213, now seen corresponding path program 1 times [2022-04-28 15:23:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:51,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961511971] [2022-04-28 15:24:09,791 WARN L232 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:24:18,707 WARN L232 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:24:21,384 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1778251213, now seen corresponding path program 2 times [2022-04-28 15:24:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:21,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844929484] [2022-04-28 15:24:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:21,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {252299#(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(196, 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); {252292#true} is VALID [2022-04-28 15:24:21,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {252292#true} assume true; {252292#true} is VALID [2022-04-28 15:24:21,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {252292#true} {252292#true} #592#return; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {252292#true} call ULTIMATE.init(); {252299#(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-28 15:24:21,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {252299#(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(196, 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); {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {252292#true} assume true; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {252292#true} {252292#true} #592#return; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {252292#true} call #t~ret159 := main(); {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {252292#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {252292#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {252292#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {252292#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {252292#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {252292#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {252292#true} assume 12292 == #t~mem43;havoc #t~mem43; {252292#true} is VALID [2022-04-28 15:24:21,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {252292#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {252292#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {252292#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {252292#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {252292#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {252292#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {252292#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {252292#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {252292#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {252292#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {252292#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {252292#true} ~skip~0 := 0; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {252292#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {252292#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {252292#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {252292#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {252292#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {252292#true} assume 4368 == #t~mem48;havoc #t~mem48; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {252292#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {252292#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {252292#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {252292#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {252292#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {252292#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {252292#true} ~skip~0 := 0; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {252292#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {252292#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {252292#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {252292#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {252292#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {252292#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {252292#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {252292#true} assume 4384 == #t~mem50;havoc #t~mem50; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {252292#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {252292#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {252292#true} is VALID [2022-04-28 15:24:21,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {252292#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {252292#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {252292#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {252292#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {252292#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {252292#true} ~skip~0 := 0; {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 60: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 61: Hoare triple {252292#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {252292#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {252292#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {252292#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {252292#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 66: Hoare triple {252292#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 67: Hoare triple {252292#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 68: Hoare triple {252292#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 69: Hoare triple {252292#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {252292#true} assume 4400 == #t~mem52;havoc #t~mem52; {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {252292#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {252292#true} is VALID [2022-04-28 15:24:21,611 INFO L290 TraceCheckUtils]: 72: Hoare triple {252292#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {252292#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {252292#true} assume !(~ret~0 <= 0); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {252292#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {252292#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {252292#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {252292#true} ~skip~0 := 0; {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 80: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 81: Hoare triple {252292#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 82: Hoare triple {252292#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 83: Hoare triple {252292#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 84: Hoare triple {252292#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 85: Hoare triple {252292#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 86: Hoare triple {252292#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 87: Hoare triple {252292#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 88: Hoare triple {252292#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 89: Hoare triple {252292#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,612 INFO L290 TraceCheckUtils]: 90: Hoare triple {252292#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 91: Hoare triple {252292#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 92: Hoare triple {252292#true} assume 4416 == #t~mem54;havoc #t~mem54; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 93: Hoare triple {252292#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 94: Hoare triple {252292#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 95: Hoare triple {252292#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 96: Hoare triple {252292#true} assume !(0 == ~tmp___6~0); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 97: Hoare triple {252292#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 98: Hoare triple {252292#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 99: Hoare triple {252292#true} ~skip~0 := 0; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 100: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 101: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 102: Hoare triple {252292#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 103: Hoare triple {252292#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 104: Hoare triple {252292#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 105: Hoare triple {252292#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 106: Hoare triple {252292#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,613 INFO L290 TraceCheckUtils]: 107: Hoare triple {252292#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 108: Hoare triple {252292#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 109: Hoare triple {252292#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 110: Hoare triple {252292#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 111: Hoare triple {252292#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 112: Hoare triple {252292#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 113: Hoare triple {252292#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 114: Hoare triple {252292#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 115: Hoare triple {252292#true} assume 4432 == #t~mem56;havoc #t~mem56; {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 116: Hoare triple {252292#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 117: Hoare triple {252292#true} assume !(5 == ~blastFlag~0); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 118: Hoare triple {252292#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 119: Hoare triple {252292#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 120: Hoare triple {252292#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 121: Hoare triple {252292#true} ~skip~0 := 0; {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 122: Hoare triple {252292#true} assume !false; {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 123: Hoare triple {252292#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 124: Hoare triple {252292#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 125: Hoare triple {252292#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 126: Hoare triple {252292#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,614 INFO L290 TraceCheckUtils]: 127: Hoare triple {252292#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 128: Hoare triple {252292#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 129: Hoare triple {252292#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 130: Hoare triple {252292#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 131: Hoare triple {252292#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 132: Hoare triple {252292#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 133: Hoare triple {252292#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 134: Hoare triple {252292#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 135: Hoare triple {252292#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 136: Hoare triple {252292#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 137: Hoare triple {252292#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 138: Hoare triple {252292#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 139: Hoare triple {252292#true} assume 4448 == #t~mem58;havoc #t~mem58; {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 140: Hoare triple {252292#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 141: Hoare triple {252292#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {252292#true} is VALID [2022-04-28 15:24:21,615 INFO L290 TraceCheckUtils]: 142: Hoare triple {252292#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {252292#true} is VALID [2022-04-28 15:24:21,616 INFO L290 TraceCheckUtils]: 143: Hoare triple {252292#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,617 INFO L290 TraceCheckUtils]: 144: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,617 INFO L290 TraceCheckUtils]: 145: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,617 INFO L290 TraceCheckUtils]: 146: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,618 INFO L290 TraceCheckUtils]: 147: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,618 INFO L290 TraceCheckUtils]: 148: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,618 INFO L290 TraceCheckUtils]: 149: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,619 INFO L290 TraceCheckUtils]: 150: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,620 INFO L290 TraceCheckUtils]: 151: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 152: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 153: Hoare triple {252297#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252298#(not (= |ssl3_connect_#t~mem47| 4099))} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 154: Hoare triple {252298#(not (= |ssl3_connect_#t~mem47| 4099))} assume 4099 == #t~mem47;havoc #t~mem47; {252293#false} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 155: Hoare triple {252293#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 156: Hoare triple {252293#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {252293#false} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 157: Hoare triple {252293#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,621 INFO L290 TraceCheckUtils]: 158: Hoare triple {252293#false} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 159: Hoare triple {252293#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 160: Hoare triple {252293#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 161: Hoare triple {252293#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 162: Hoare triple {252293#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 163: Hoare triple {252293#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 164: Hoare triple {252293#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 165: Hoare triple {252293#false} ~skip~0 := 0; {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 166: Hoare triple {252293#false} assume !false; {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 167: Hoare triple {252293#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 168: Hoare triple {252293#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 169: Hoare triple {252293#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 170: Hoare triple {252293#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 171: Hoare triple {252293#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 172: Hoare triple {252293#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 173: Hoare triple {252293#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 174: Hoare triple {252293#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 175: Hoare triple {252293#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 176: Hoare triple {252293#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 177: Hoare triple {252293#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,622 INFO L290 TraceCheckUtils]: 178: Hoare triple {252293#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 179: Hoare triple {252293#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 180: Hoare triple {252293#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 181: Hoare triple {252293#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 182: Hoare triple {252293#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 183: Hoare triple {252293#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 184: Hoare triple {252293#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 185: Hoare triple {252293#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 186: Hoare triple {252293#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 187: Hoare triple {252293#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 188: Hoare triple {252293#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 189: Hoare triple {252293#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 190: Hoare triple {252293#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 191: Hoare triple {252293#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 192: Hoare triple {252293#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 193: Hoare triple {252293#false} assume 4512 == #t~mem68;havoc #t~mem68; {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 194: Hoare triple {252293#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 195: Hoare triple {252293#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 196: Hoare triple {252293#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {252293#false} is VALID [2022-04-28 15:24:21,623 INFO L290 TraceCheckUtils]: 197: Hoare triple {252293#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 198: Hoare triple {252293#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 199: Hoare triple {252293#false} assume !(0 == ~tmp___8~0); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 200: Hoare triple {252293#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 201: Hoare triple {252293#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 202: Hoare triple {252293#false} ~skip~0 := 0; {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 203: Hoare triple {252293#false} assume !false; {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 204: Hoare triple {252293#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 205: Hoare triple {252293#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 206: Hoare triple {252293#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 207: Hoare triple {252293#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 208: Hoare triple {252293#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 209: Hoare triple {252293#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 210: Hoare triple {252293#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 211: Hoare triple {252293#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 212: Hoare triple {252293#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 213: Hoare triple {252293#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 214: Hoare triple {252293#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 215: Hoare triple {252293#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 216: Hoare triple {252293#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,624 INFO L290 TraceCheckUtils]: 217: Hoare triple {252293#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {252293#false} is VALID [2022-04-28 15:24:21,625 INFO L290 TraceCheckUtils]: 218: Hoare triple {252293#false} assume 4432 == #t~mem56;havoc #t~mem56; {252293#false} is VALID [2022-04-28 15:24:21,625 INFO L290 TraceCheckUtils]: 219: Hoare triple {252293#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {252293#false} is VALID [2022-04-28 15:24:21,625 INFO L290 TraceCheckUtils]: 220: Hoare triple {252293#false} assume 5 == ~blastFlag~0; {252293#false} is VALID [2022-04-28 15:24:21,625 INFO L290 TraceCheckUtils]: 221: Hoare triple {252293#false} assume !false; {252293#false} is VALID [2022-04-28 15:24:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-04-28 15:24:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844929484] [2022-04-28 15:24:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844929484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:21,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:21,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:21,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:21,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961511971] [2022-04-28 15:24:21,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961511971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:21,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:21,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001567880] [2022-04-28 15:24:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:21,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 222 [2022-04-28 15:24:21,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:21,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:21,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:21,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:24:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:21,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:24:21,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:24:21,709 INFO L87 Difference]: Start difference. First operand 2453 states and 3532 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:23,729 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-28 15:24:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:26,036 INFO L93 Difference]: Finished difference Result 5474 states and 7862 transitions. [2022-04-28 15:24:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:24:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 222 [2022-04-28 15:24:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:24:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:24:26,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 15:24:26,344 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-28 15:24:26,697 INFO L225 Difference]: With dead ends: 5474 [2022-04-28 15:24:26,697 INFO L226 Difference]: Without dead ends: 3037 [2022-04-28 15:24:26,701 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-28 15:24:26,701 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 113 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:26,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:24:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3037 states. [2022-04-28 15:24:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3037 to 2453. [2022-04-28 15:24:26,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:26,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3037 states. Second operand has 2453 states, 2448 states have (on average 1.4268790849673203) internal successors, (3493), 2448 states have internal predecessors, (3493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:26,852 INFO L74 IsIncluded]: Start isIncluded. First operand 3037 states. Second operand has 2453 states, 2448 states have (on average 1.4268790849673203) internal successors, (3493), 2448 states have internal predecessors, (3493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:26,854 INFO L87 Difference]: Start difference. First operand 3037 states. Second operand has 2453 states, 2448 states have (on average 1.4268790849673203) internal successors, (3493), 2448 states have internal predecessors, (3493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:27,071 INFO L93 Difference]: Finished difference Result 3037 states and 4315 transitions. [2022-04-28 15:24:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4315 transitions. [2022-04-28 15:24:27,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:27,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:27,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 2453 states, 2448 states have (on average 1.4268790849673203) internal successors, (3493), 2448 states have internal predecessors, (3493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3037 states. [2022-04-28 15:24:27,077 INFO L87 Difference]: Start difference. First operand has 2453 states, 2448 states have (on average 1.4268790849673203) internal successors, (3493), 2448 states have internal predecessors, (3493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3037 states. [2022-04-28 15:24:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:27,292 INFO L93 Difference]: Finished difference Result 3037 states and 4315 transitions. [2022-04-28 15:24:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4315 transitions. [2022-04-28 15:24:27,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:27,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:27,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:27,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2448 states have (on average 1.4268790849673203) internal successors, (3493), 2448 states have internal predecessors, (3493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3497 transitions. [2022-04-28 15:24:27,565 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3497 transitions. Word has length 222 [2022-04-28 15:24:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:27,566 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3497 transitions. [2022-04-28 15:24:27,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:27,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2453 states and 3497 transitions. [2022-04-28 15:24:30,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3497 edges. 3497 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3497 transitions. [2022-04-28 15:24:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-04-28 15:24:30,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:30,984 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:24:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:24:30,984 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash -318441025, now seen corresponding path program 1 times [2022-04-28 15:24:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:30,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266578134] [2022-04-28 15:24:47,389 WARN L232 SmtUtils]: Spent 13.43s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:24:56,902 WARN L232 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:25:06,437 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash -318441025, now seen corresponding path program 2 times [2022-04-28 15:25:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:06,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013379602] [2022-04-28 15:25:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:06,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {274239#(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(196, 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); {274232#true} is VALID [2022-04-28 15:25:06,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {274232#true} assume true; {274232#true} is VALID [2022-04-28 15:25:06,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274232#true} {274232#true} #592#return; {274232#true} is VALID [2022-04-28 15:25:06,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {274232#true} call ULTIMATE.init(); {274239#(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-28 15:25:06,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {274239#(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(196, 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); {274232#true} is VALID [2022-04-28 15:25:06,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {274232#true} assume true; {274232#true} is VALID [2022-04-28 15:25:06,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274232#true} {274232#true} #592#return; {274232#true} is VALID [2022-04-28 15:25:06,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {274232#true} call #t~ret159 := main(); {274232#true} is VALID [2022-04-28 15:25:06,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {274232#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {274232#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {274232#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {274232#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {274232#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {274232#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {274232#true} assume 12292 == #t~mem43;havoc #t~mem43; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {274232#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {274232#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {274232#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {274232#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {274232#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {274232#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {274232#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {274232#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {274232#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {274232#true} assume 4368 == #t~mem48;havoc #t~mem48; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {274232#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {274232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {274232#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {274232#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {274232#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {274232#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {274232#true} assume 4384 == #t~mem50;havoc #t~mem50; {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {274232#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {274232#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {274232#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 54: Hoare triple {274232#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {274232#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 60: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {274232#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {274232#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {274232#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 69: Hoare triple {274232#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {274232#true} assume 4400 == #t~mem52;havoc #t~mem52; {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 71: Hoare triple {274232#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {274232#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 73: Hoare triple {274232#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 74: Hoare triple {274232#true} assume !(~ret~0 <= 0); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 75: Hoare triple {274232#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 79: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 80: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 81: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 82: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 83: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 84: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 85: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 86: Hoare triple {274232#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 87: Hoare triple {274232#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {274232#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {274232#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 90: Hoare triple {274232#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 91: Hoare triple {274232#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {274232#true} assume 4416 == #t~mem54;havoc #t~mem54; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {274232#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 94: Hoare triple {274232#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 95: Hoare triple {274232#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {274232#true} is VALID [2022-04-28 15:25:06,617 INFO L290 TraceCheckUtils]: 96: Hoare triple {274232#true} assume !(0 == ~tmp___6~0); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 97: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 98: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 99: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 100: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 101: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 102: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 103: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 104: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 105: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 106: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 107: Hoare triple {274232#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 108: Hoare triple {274232#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 109: Hoare triple {274232#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 110: Hoare triple {274232#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 111: Hoare triple {274232#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 112: Hoare triple {274232#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 113: Hoare triple {274232#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,618 INFO L290 TraceCheckUtils]: 114: Hoare triple {274232#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 115: Hoare triple {274232#true} assume 4432 == #t~mem56;havoc #t~mem56; {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 116: Hoare triple {274232#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 117: Hoare triple {274232#true} assume !(5 == ~blastFlag~0); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 118: Hoare triple {274232#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 119: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 120: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 121: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 122: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 123: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 124: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 125: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 126: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 127: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 128: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 129: Hoare triple {274232#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,619 INFO L290 TraceCheckUtils]: 130: Hoare triple {274232#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 131: Hoare triple {274232#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 132: Hoare triple {274232#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 133: Hoare triple {274232#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 134: Hoare triple {274232#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 135: Hoare triple {274232#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 136: Hoare triple {274232#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 137: Hoare triple {274232#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 138: Hoare triple {274232#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 139: Hoare triple {274232#true} assume 4448 == #t~mem58;havoc #t~mem58; {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 140: Hoare triple {274232#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 141: Hoare triple {274232#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 142: Hoare triple {274232#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 143: Hoare triple {274232#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,620 INFO L290 TraceCheckUtils]: 144: Hoare triple {274232#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 145: Hoare triple {274232#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 146: Hoare triple {274232#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 147: Hoare triple {274232#true} ~skip~0 := 0; {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 148: Hoare triple {274232#true} assume !false; {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 149: Hoare triple {274232#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 150: Hoare triple {274232#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 151: Hoare triple {274232#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 152: Hoare triple {274232#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 153: Hoare triple {274232#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 154: Hoare triple {274232#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 155: Hoare triple {274232#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 156: Hoare triple {274232#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,621 INFO L290 TraceCheckUtils]: 157: Hoare triple {274232#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,622 INFO L290 TraceCheckUtils]: 158: Hoare triple {274232#true} assume 4385 == #t~mem51;havoc #t~mem51; {274232#true} is VALID [2022-04-28 15:25:06,622 INFO L290 TraceCheckUtils]: 159: Hoare triple {274232#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {274232#true} is VALID [2022-04-28 15:25:06,622 INFO L290 TraceCheckUtils]: 160: Hoare triple {274232#true} assume !(1 == ~blastFlag~0); {274232#true} is VALID [2022-04-28 15:25:06,622 INFO L290 TraceCheckUtils]: 161: Hoare triple {274232#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {274232#true} is VALID [2022-04-28 15:25:06,623 INFO L290 TraceCheckUtils]: 162: Hoare triple {274232#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,623 INFO L290 TraceCheckUtils]: 163: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,624 INFO L290 TraceCheckUtils]: 164: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,624 INFO L290 TraceCheckUtils]: 165: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,624 INFO L290 TraceCheckUtils]: 166: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,625 INFO L290 TraceCheckUtils]: 167: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,625 INFO L290 TraceCheckUtils]: 168: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,625 INFO L290 TraceCheckUtils]: 169: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,626 INFO L290 TraceCheckUtils]: 170: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,626 INFO L290 TraceCheckUtils]: 171: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,626 INFO L290 TraceCheckUtils]: 172: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,627 INFO L290 TraceCheckUtils]: 173: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,627 INFO L290 TraceCheckUtils]: 174: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,628 INFO L290 TraceCheckUtils]: 175: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,628 INFO L290 TraceCheckUtils]: 176: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:25:06,628 INFO L290 TraceCheckUtils]: 177: Hoare triple {274237#(= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {274238#(= |ssl3_connect_#t~mem52| 4400)} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 178: Hoare triple {274238#(= |ssl3_connect_#t~mem52| 4400)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 179: Hoare triple {274233#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 180: Hoare triple {274233#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 181: Hoare triple {274233#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 182: Hoare triple {274233#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 183: Hoare triple {274233#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 184: Hoare triple {274233#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 185: Hoare triple {274233#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 186: Hoare triple {274233#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 187: Hoare triple {274233#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 188: Hoare triple {274233#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,629 INFO L290 TraceCheckUtils]: 189: Hoare triple {274233#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 190: Hoare triple {274233#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 191: Hoare triple {274233#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 192: Hoare triple {274233#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 193: Hoare triple {274233#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 194: Hoare triple {274233#false} assume 4512 == #t~mem68;havoc #t~mem68; {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 195: Hoare triple {274233#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 196: Hoare triple {274233#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 197: Hoare triple {274233#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 198: Hoare triple {274233#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 199: Hoare triple {274233#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 200: Hoare triple {274233#false} assume !(0 == ~tmp___8~0); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 201: Hoare triple {274233#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 202: Hoare triple {274233#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {274233#false} is VALID [2022-04-28 15:25:06,630 INFO L290 TraceCheckUtils]: 203: Hoare triple {274233#false} ~skip~0 := 0; {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 204: Hoare triple {274233#false} assume !false; {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 205: Hoare triple {274233#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 206: Hoare triple {274233#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 207: Hoare triple {274233#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 208: Hoare triple {274233#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 209: Hoare triple {274233#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 210: Hoare triple {274233#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 211: Hoare triple {274233#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 212: Hoare triple {274233#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 213: Hoare triple {274233#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 214: Hoare triple {274233#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 215: Hoare triple {274233#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 216: Hoare triple {274233#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,631 INFO L290 TraceCheckUtils]: 217: Hoare triple {274233#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,632 INFO L290 TraceCheckUtils]: 218: Hoare triple {274233#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {274233#false} is VALID [2022-04-28 15:25:06,632 INFO L290 TraceCheckUtils]: 219: Hoare triple {274233#false} assume 4432 == #t~mem56;havoc #t~mem56; {274233#false} is VALID [2022-04-28 15:25:06,632 INFO L290 TraceCheckUtils]: 220: Hoare triple {274233#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {274233#false} is VALID [2022-04-28 15:25:06,632 INFO L290 TraceCheckUtils]: 221: Hoare triple {274233#false} assume 5 == ~blastFlag~0; {274233#false} is VALID [2022-04-28 15:25:06,632 INFO L290 TraceCheckUtils]: 222: Hoare triple {274233#false} assume !false; {274233#false} is VALID [2022-04-28 15:25:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-04-28 15:25:06,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:06,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013379602] [2022-04-28 15:25:06,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013379602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:06,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:06,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:06,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:06,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266578134] [2022-04-28 15:25:06,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266578134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:06,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:06,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856876006] [2022-04-28 15:25:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 223 [2022-04-28 15:25:06,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:06,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:06,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:06,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:25:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:06,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:25:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:25:06,721 INFO L87 Difference]: Start difference. First operand 2453 states and 3497 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:08,741 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-28 15:25:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:10,765 INFO L93 Difference]: Finished difference Result 4949 states and 7041 transitions. [2022-04-28 15:25:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:25:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 223 [2022-04-28 15:25:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-28 15:25:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-28 15:25:10,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-28 15:25:11,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:11,239 INFO L225 Difference]: With dead ends: 4949 [2022-04-28 15:25:11,239 INFO L226 Difference]: Without dead ends: 2512 [2022-04-28 15:25:11,241 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-28 15:25:11,242 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 25 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:11,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 483 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:25:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2022-04-28 15:25:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2453. [2022-04-28 15:25:11,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:11,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2512 states. Second operand has 2453 states, 2448 states have (on average 1.4248366013071896) internal successors, (3488), 2448 states have internal predecessors, (3488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:11,407 INFO L74 IsIncluded]: Start isIncluded. First operand 2512 states. Second operand has 2453 states, 2448 states have (on average 1.4248366013071896) internal successors, (3488), 2448 states have internal predecessors, (3488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:11,408 INFO L87 Difference]: Start difference. First operand 2512 states. Second operand has 2453 states, 2448 states have (on average 1.4248366013071896) internal successors, (3488), 2448 states have internal predecessors, (3488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:11,564 INFO L93 Difference]: Finished difference Result 2512 states and 3559 transitions. [2022-04-28 15:25:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3559 transitions. [2022-04-28 15:25:11,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:11,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:11,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 2453 states, 2448 states have (on average 1.4248366013071896) internal successors, (3488), 2448 states have internal predecessors, (3488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2512 states. [2022-04-28 15:25:11,570 INFO L87 Difference]: Start difference. First operand has 2453 states, 2448 states have (on average 1.4248366013071896) internal successors, (3488), 2448 states have internal predecessors, (3488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2512 states. [2022-04-28 15:25:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:11,734 INFO L93 Difference]: Finished difference Result 2512 states and 3559 transitions. [2022-04-28 15:25:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3559 transitions. [2022-04-28 15:25:11,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:11,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:11,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:11,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2448 states have (on average 1.4248366013071896) internal successors, (3488), 2448 states have internal predecessors, (3488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3492 transitions. [2022-04-28 15:25:12,020 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3492 transitions. Word has length 223 [2022-04-28 15:25:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:12,020 INFO L495 AbstractCegarLoop]: Abstraction has 2453 states and 3492 transitions. [2022-04-28 15:25:12,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:12,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2453 states and 3492 transitions. [2022-04-28 15:25:15,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3492 edges. 3492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3492 transitions. [2022-04-28 15:25:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-28 15:25:15,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:15,384 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:25:15,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:25:15,384 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash -841165724, now seen corresponding path program 1 times [2022-04-28 15:25:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:15,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1131178745] [2022-04-28 15:25:34,582 WARN L232 SmtUtils]: Spent 15.97s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:25:50,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -841165724, now seen corresponding path program 2 times [2022-04-28 15:25:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038324989] [2022-04-28 15:25:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:50,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {294079#(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(196, 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); {294072#true} is VALID [2022-04-28 15:25:50,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {294072#true} assume true; {294072#true} is VALID [2022-04-28 15:25:50,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294072#true} {294072#true} #592#return; {294072#true} is VALID [2022-04-28 15:25:50,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {294072#true} call ULTIMATE.init(); {294079#(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-28 15:25:50,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {294079#(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(196, 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); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {294072#true} assume true; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294072#true} {294072#true} #592#return; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {294072#true} call #t~ret159 := main(); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {294072#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L272 TraceCheckUtils]: 6: Hoare triple {294072#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {294072#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {294072#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {294072#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {294072#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {294072#true} assume !false; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {294072#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {294072#true} assume 12292 == #t~mem43;havoc #t~mem43; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {294072#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {294072#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {294072#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {294072#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {294072#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {294072#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {294072#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {294072#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {294072#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {294072#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {294072#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {294072#true} ~skip~0 := 0; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {294072#true} assume !false; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {294072#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {294072#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {294072#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {294072#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {294072#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {294072#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {294072#true} assume 4368 == #t~mem48;havoc #t~mem48; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {294072#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {294072#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {294072#true} is VALID [2022-04-28 15:25:50,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {294072#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {294072#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {294072#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {294072#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {294072#true} ~skip~0 := 0; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {294072#true} assume !false; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {294072#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {294072#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {294072#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {294072#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {294072#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {294072#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {294072#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {294072#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {294072#true} assume 4384 == #t~mem50;havoc #t~mem50; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {294072#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {294072#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {294072#true} is VALID [2022-04-28 15:25:50,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {294072#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {294072#true} is VALID [2022-04-28 15:25:50,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {294072#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} ~skip~0 := 0; {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !false; {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,525 INFO L290 TraceCheckUtils]: 64: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,525 INFO L290 TraceCheckUtils]: 67: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} is VALID [2022-04-28 15:25:50,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {294077#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4560)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {294078#(= |ssl3_connect_#t~mem53| 4560)} is VALID [2022-04-28 15:25:50,526 INFO L290 TraceCheckUtils]: 71: Hoare triple {294078#(= |ssl3_connect_#t~mem53| 4560)} assume 4401 == #t~mem53;havoc #t~mem53; {294073#false} is VALID [2022-04-28 15:25:50,526 INFO L290 TraceCheckUtils]: 72: Hoare triple {294073#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {294073#false} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 74: Hoare triple {294073#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 75: Hoare triple {294073#false} assume !(~ret~0 <= 0); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 76: Hoare triple {294073#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 77: Hoare triple {294073#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {294073#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {294073#false} ~skip~0 := 0; {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {294073#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {294073#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 83: Hoare triple {294073#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {294073#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 85: Hoare triple {294073#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 86: Hoare triple {294073#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 87: Hoare triple {294073#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {294073#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {294073#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 90: Hoare triple {294073#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,527 INFO L290 TraceCheckUtils]: 91: Hoare triple {294073#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 92: Hoare triple {294073#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {294073#false} assume 4416 == #t~mem54;havoc #t~mem54; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 94: Hoare triple {294073#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {294073#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 96: Hoare triple {294073#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {294073#false} assume !(0 == ~tmp___6~0); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {294073#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 99: Hoare triple {294073#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 100: Hoare triple {294073#false} ~skip~0 := 0; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 101: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 102: Hoare triple {294073#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 103: Hoare triple {294073#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 104: Hoare triple {294073#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 105: Hoare triple {294073#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 106: Hoare triple {294073#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 107: Hoare triple {294073#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 108: Hoare triple {294073#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 109: Hoare triple {294073#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 110: Hoare triple {294073#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,528 INFO L290 TraceCheckUtils]: 111: Hoare triple {294073#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 112: Hoare triple {294073#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 113: Hoare triple {294073#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 114: Hoare triple {294073#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 115: Hoare triple {294073#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 116: Hoare triple {294073#false} assume 4432 == #t~mem56;havoc #t~mem56; {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 117: Hoare triple {294073#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 118: Hoare triple {294073#false} assume !(5 == ~blastFlag~0); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 119: Hoare triple {294073#false} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 120: Hoare triple {294073#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {294073#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 122: Hoare triple {294073#false} ~skip~0 := 0; {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {294073#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {294073#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 126: Hoare triple {294073#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 127: Hoare triple {294073#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 128: Hoare triple {294073#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {294073#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {294073#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 131: Hoare triple {294073#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {294073#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {294073#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 134: Hoare triple {294073#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 135: Hoare triple {294073#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 136: Hoare triple {294073#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 137: Hoare triple {294073#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 138: Hoare triple {294073#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 139: Hoare triple {294073#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 140: Hoare triple {294073#false} assume 4448 == #t~mem58;havoc #t~mem58; {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 141: Hoare triple {294073#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 142: Hoare triple {294073#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 143: Hoare triple {294073#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 144: Hoare triple {294073#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 145: Hoare triple {294073#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 146: Hoare triple {294073#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 147: Hoare triple {294073#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 148: Hoare triple {294073#false} ~skip~0 := 0; {294073#false} is VALID [2022-04-28 15:25:50,530 INFO L290 TraceCheckUtils]: 149: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 150: Hoare triple {294073#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 151: Hoare triple {294073#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 152: Hoare triple {294073#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 153: Hoare triple {294073#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 154: Hoare triple {294073#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 155: Hoare triple {294073#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 156: Hoare triple {294073#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 157: Hoare triple {294073#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 158: Hoare triple {294073#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 159: Hoare triple {294073#false} assume 4385 == #t~mem51;havoc #t~mem51; {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 160: Hoare triple {294073#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 161: Hoare triple {294073#false} assume !(1 == ~blastFlag~0); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 162: Hoare triple {294073#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 163: Hoare triple {294073#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 164: Hoare triple {294073#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 165: Hoare triple {294073#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 166: Hoare triple {294073#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 167: Hoare triple {294073#false} ~skip~0 := 0; {294073#false} is VALID [2022-04-28 15:25:50,531 INFO L290 TraceCheckUtils]: 168: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 169: Hoare triple {294073#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 170: Hoare triple {294073#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 171: Hoare triple {294073#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 172: Hoare triple {294073#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 173: Hoare triple {294073#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 174: Hoare triple {294073#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 175: Hoare triple {294073#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 176: Hoare triple {294073#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 177: Hoare triple {294073#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 178: Hoare triple {294073#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 179: Hoare triple {294073#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 180: Hoare triple {294073#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 181: Hoare triple {294073#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 182: Hoare triple {294073#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 183: Hoare triple {294073#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 184: Hoare triple {294073#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 185: Hoare triple {294073#false} assume !(4448 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 186: Hoare triple {294073#false} assume !(4449 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 187: Hoare triple {294073#false} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,532 INFO L290 TraceCheckUtils]: 188: Hoare triple {294073#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 189: Hoare triple {294073#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 190: Hoare triple {294073#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 191: Hoare triple {294073#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 192: Hoare triple {294073#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 193: Hoare triple {294073#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 194: Hoare triple {294073#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 195: Hoare triple {294073#false} assume 4512 == #t~mem68;havoc #t~mem68; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 196: Hoare triple {294073#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 197: Hoare triple {294073#false} assume !(~ret~0 <= 0);call write~int(4528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem111.base, #t~mem111.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem112.base, #t~mem112.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem113.base, #t~mem113.offset := read~$Pointer$(#t~mem112.base, 888 + #t~mem112.offset, 8);call write~$Pointer$(#t~mem113.base, #t~mem113.offset, #t~mem111.base, 192 + #t~mem111.offset, 8);havoc #t~mem111.base, #t~mem111.offset;havoc #t~mem112.base, #t~mem112.offset;havoc #t~mem113.base, #t~mem113.offset;call #t~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(#t~mem114.base, 967 + #t~mem114.offset, 8); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 198: Hoare triple {294073#false} assume 0 == (#t~mem115.base + #t~mem115.offset) % 18446744073709551616;havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;call #t~mem116.base, #t~mem116.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem116.base, 188 + #t~mem116.offset, 4);havoc #t~mem116.base, #t~mem116.offset; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 199: Hoare triple {294073#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 200: Hoare triple {294073#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 201: Hoare triple {294073#false} assume !(0 == ~tmp___8~0); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 202: Hoare triple {294073#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 203: Hoare triple {294073#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 204: Hoare triple {294073#false} ~skip~0 := 0; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 205: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 206: Hoare triple {294073#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,533 INFO L290 TraceCheckUtils]: 207: Hoare triple {294073#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 208: Hoare triple {294073#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 209: Hoare triple {294073#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 210: Hoare triple {294073#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 211: Hoare triple {294073#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 212: Hoare triple {294073#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 213: Hoare triple {294073#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 214: Hoare triple {294073#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 215: Hoare triple {294073#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 216: Hoare triple {294073#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 217: Hoare triple {294073#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 218: Hoare triple {294073#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 219: Hoare triple {294073#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 220: Hoare triple {294073#false} assume 4432 == #t~mem56;havoc #t~mem56; {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 221: Hoare triple {294073#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 222: Hoare triple {294073#false} assume 5 == ~blastFlag~0; {294073#false} is VALID [2022-04-28 15:25:50,534 INFO L290 TraceCheckUtils]: 223: Hoare triple {294073#false} assume !false; {294073#false} is VALID [2022-04-28 15:25:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-04-28 15:25:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:50,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038324989] [2022-04-28 15:25:50,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038324989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:50,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:50,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:50,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:50,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1131178745] [2022-04-28 15:25:50,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1131178745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:50,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:50,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373501700] [2022-04-28 15:25:50,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-28 15:25:50,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:50,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:50,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:50,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:25:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:25:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:25:50,613 INFO L87 Difference]: Start difference. First operand 2453 states and 3492 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:52,637 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-28 15:25:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:55,034 INFO L93 Difference]: Finished difference Result 5243 states and 7469 transitions. [2022-04-28 15:25:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:25:55,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 224 [2022-04-28 15:25:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 15:25:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 15:25:55,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-28 15:25:55,308 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-28 15:25:55,626 INFO L225 Difference]: With dead ends: 5243 [2022-04-28 15:25:55,627 INFO L226 Difference]: Without dead ends: 2806 [2022-04-28 15:25:55,629 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-28 15:25:55,629 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 70 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:55,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 530 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:25:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2022-04-28 15:25:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2558. [2022-04-28 15:25:55,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:55,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2806 states. Second operand has 2558 states, 2553 states have (on average 1.4230317273795534) internal successors, (3633), 2553 states have internal predecessors, (3633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:55,785 INFO L74 IsIncluded]: Start isIncluded. First operand 2806 states. Second operand has 2558 states, 2553 states have (on average 1.4230317273795534) internal successors, (3633), 2553 states have internal predecessors, (3633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:55,787 INFO L87 Difference]: Start difference. First operand 2806 states. Second operand has 2558 states, 2553 states have (on average 1.4230317273795534) internal successors, (3633), 2553 states have internal predecessors, (3633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:55,970 INFO L93 Difference]: Finished difference Result 2806 states and 3992 transitions. [2022-04-28 15:25:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3992 transitions. [2022-04-28 15:25:55,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:55,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:55,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 2558 states, 2553 states have (on average 1.4230317273795534) internal successors, (3633), 2553 states have internal predecessors, (3633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2806 states. [2022-04-28 15:25:55,976 INFO L87 Difference]: Start difference. First operand has 2558 states, 2553 states have (on average 1.4230317273795534) internal successors, (3633), 2553 states have internal predecessors, (3633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2806 states. [2022-04-28 15:25:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:56,161 INFO L93 Difference]: Finished difference Result 2806 states and 3992 transitions. [2022-04-28 15:25:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3992 transitions. [2022-04-28 15:25:56,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:56,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:56,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:56,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2553 states have (on average 1.4230317273795534) internal successors, (3633), 2553 states have internal predecessors, (3633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3637 transitions. [2022-04-28 15:25:56,464 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3637 transitions. Word has length 224 [2022-04-28 15:25:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:56,464 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3637 transitions. [2022-04-28 15:25:56,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:56,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2558 states and 3637 transitions. [2022-04-28 15:25:59,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3637 edges. 3637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3637 transitions. [2022-04-28 15:26:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-04-28 15:26:00,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:00,002 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:00,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:26:00,002 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -496155121, now seen corresponding path program 1 times [2022-04-28 15:26:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:00,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440990746] [2022-04-28 15:26:10,606 WARN L232 SmtUtils]: Spent 9.86s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:26:18,674 WARN L232 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:26:26,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:26:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -496155121, now seen corresponding path program 2 times [2022-04-28 15:26:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:26,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029845885] [2022-04-28 15:26:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:26,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {315305#(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(196, 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); {315298#true} is VALID [2022-04-28 15:26:26,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {315298#true} assume true; {315298#true} is VALID [2022-04-28 15:26:26,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {315298#true} {315298#true} #592#return; {315298#true} is VALID [2022-04-28 15:26:26,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {315298#true} call ULTIMATE.init(); {315305#(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-28 15:26:26,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {315305#(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(196, 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); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {315298#true} assume true; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315298#true} {315298#true} #592#return; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {315298#true} call #t~ret159 := main(); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {315298#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {315298#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {315298#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet30 % 18446744073709551616 % 18446744073709551616 else #t~nondet30 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet30;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {315298#true} assume 0 != (#t~mem35.base + #t~mem35.offset) % 18446744073709551616;havoc #t~mem35.base, #t~mem35.offset;call #t~mem36.base, #t~mem36.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem36.base, #t~mem36.offset;havoc #t~mem36.base, #t~mem36.offset; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {315298#true} call #t~mem41 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem41, ~s.base, 44 + ~s.offset, 4);havoc #t~mem41; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {315298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {315298#true} assume 12292 == #t~mem43;havoc #t~mem43; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {315298#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem76.base, #t~mem76.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem77 := read~int(#t~mem76.base, 120 + #t~mem76.offset, 4);call write~int(1 + #t~mem77, #t~mem76.base, 120 + #t~mem76.offset, 4);havoc #t~mem76.base, #t~mem76.offset;havoc #t~mem77; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {315298#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {315298#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {315298#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {315298#true} assume !(768 != (if 0 == #t~mem78 then 0 else (if 1 == #t~mem78 then 0 else ~bitwiseAnd(#t~mem78, 65280))));havoc #t~mem78;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem79.base, #t~mem79.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {315298#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 18446744073709551616);havoc #t~mem79.base, #t~mem79.offset; {315298#true} is VALID [2022-04-28 15:26:26,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {315298#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {315298#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {315298#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 116 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 116 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84;call write~int(0, ~s.base, 88 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {315298#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {315298#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {315298#true} ~skip~0 := 0; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {315298#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {315298#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {315298#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {315298#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {315298#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {315298#true} assume 4368 == #t~mem48;havoc #t~mem48; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {315298#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet85 && #t~nondet85 <= 2147483647;~ret~0 := #t~nondet85;havoc #t~nondet85; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {315298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {315298#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {315298#true} assume (#t~mem86.base + #t~mem86.offset) % 18446744073709551616 != (#t~mem87.base + #t~mem87.offset) % 18446744073709551616;havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87.base, #t~mem87.offset; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {315298#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {315298#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315298#true} is VALID [2022-04-28 15:26:26,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {315298#true} ~skip~0 := 0; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {315298#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {315298#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {315298#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {315298#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {315298#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {315298#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {315298#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {315298#true} assume 4384 == #t~mem50;havoc #t~mem50; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {315298#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {315298#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {315298#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {315298#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 55: Hoare triple {315298#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {315298#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {315298#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {315298#true} ~skip~0 := 0; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,419 INFO L290 TraceCheckUtils]: 60: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 61: Hoare triple {315298#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 62: Hoare triple {315298#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {315298#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {315298#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {315298#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {315298#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {315298#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {315298#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {315298#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 70: Hoare triple {315298#true} assume 4400 == #t~mem52;havoc #t~mem52; {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {315298#true} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {315298#true} assume !(0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616);havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {315298#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {315298#true} assume !(~ret~0 <= 0); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {315298#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {315298#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {315298#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {315298#true} ~skip~0 := 0; {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 79: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,420 INFO L290 TraceCheckUtils]: 80: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {315298#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 82: Hoare triple {315298#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 83: Hoare triple {315298#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 84: Hoare triple {315298#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 85: Hoare triple {315298#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 86: Hoare triple {315298#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 87: Hoare triple {315298#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 88: Hoare triple {315298#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 89: Hoare triple {315298#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 90: Hoare triple {315298#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 91: Hoare triple {315298#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 92: Hoare triple {315298#true} assume 4416 == #t~mem54;havoc #t~mem54; {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 93: Hoare triple {315298#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 94: Hoare triple {315298#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 95: Hoare triple {315298#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 96: Hoare triple {315298#true} assume !(0 == ~tmp___6~0); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 97: Hoare triple {315298#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 98: Hoare triple {315298#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315298#true} is VALID [2022-04-28 15:26:26,421 INFO L290 TraceCheckUtils]: 99: Hoare triple {315298#true} ~skip~0 := 0; {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 100: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 101: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 102: Hoare triple {315298#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 103: Hoare triple {315298#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 104: Hoare triple {315298#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 105: Hoare triple {315298#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 106: Hoare triple {315298#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 107: Hoare triple {315298#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 108: Hoare triple {315298#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 109: Hoare triple {315298#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 110: Hoare triple {315298#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 111: Hoare triple {315298#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 112: Hoare triple {315298#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 113: Hoare triple {315298#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 114: Hoare triple {315298#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 115: Hoare triple {315298#true} assume 4432 == #t~mem56;havoc #t~mem56; {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 116: Hoare triple {315298#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 117: Hoare triple {315298#true} assume !(5 == ~blastFlag~0); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 118: Hoare triple {315298#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,422 INFO L290 TraceCheckUtils]: 119: Hoare triple {315298#true} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 120: Hoare triple {315298#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 121: Hoare triple {315298#true} ~skip~0 := 0; {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 122: Hoare triple {315298#true} assume !false; {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 123: Hoare triple {315298#true} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 124: Hoare triple {315298#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 125: Hoare triple {315298#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 126: Hoare triple {315298#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 127: Hoare triple {315298#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 128: Hoare triple {315298#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 129: Hoare triple {315298#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 130: Hoare triple {315298#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 131: Hoare triple {315298#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 132: Hoare triple {315298#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 133: Hoare triple {315298#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 134: Hoare triple {315298#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 135: Hoare triple {315298#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 136: Hoare triple {315298#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 137: Hoare triple {315298#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 138: Hoare triple {315298#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,423 INFO L290 TraceCheckUtils]: 139: Hoare triple {315298#true} assume 4448 == #t~mem58;havoc #t~mem58; {315298#true} is VALID [2022-04-28 15:26:26,424 INFO L290 TraceCheckUtils]: 140: Hoare triple {315298#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {315298#true} is VALID [2022-04-28 15:26:26,424 INFO L290 TraceCheckUtils]: 141: Hoare triple {315298#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {315298#true} is VALID [2022-04-28 15:26:26,424 INFO L290 TraceCheckUtils]: 142: Hoare triple {315298#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem99 := read~int(#t~mem98.base, 912 + #t~mem98.offset, 4); {315298#true} is VALID [2022-04-28 15:26:26,424 INFO L290 TraceCheckUtils]: 143: Hoare triple {315298#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,425 INFO L290 TraceCheckUtils]: 144: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,425 INFO L290 TraceCheckUtils]: 145: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,426 INFO L290 TraceCheckUtils]: 146: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,426 INFO L290 TraceCheckUtils]: 147: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,426 INFO L290 TraceCheckUtils]: 148: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,426 INFO L290 TraceCheckUtils]: 149: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,427 INFO L290 TraceCheckUtils]: 150: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,427 INFO L290 TraceCheckUtils]: 151: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,427 INFO L290 TraceCheckUtils]: 152: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,428 INFO L290 TraceCheckUtils]: 153: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,428 INFO L290 TraceCheckUtils]: 154: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,428 INFO L290 TraceCheckUtils]: 155: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 156: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 157: Hoare triple {315303#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315304#(not (= |ssl3_connect_#t~mem51| 4385))} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 158: Hoare triple {315304#(not (= |ssl3_connect_#t~mem51| 4385))} assume 4385 == #t~mem51;havoc #t~mem51; {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 159: Hoare triple {315299#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 160: Hoare triple {315299#false} assume !(1 == ~blastFlag~0); {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 161: Hoare triple {315299#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 128 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 162: Hoare triple {315299#false} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 163: Hoare triple {315299#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 164: Hoare triple {315299#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,429 INFO L290 TraceCheckUtils]: 165: Hoare triple {315299#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 166: Hoare triple {315299#false} ~skip~0 := 0; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 167: Hoare triple {315299#false} assume !false; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 168: Hoare triple {315299#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 169: Hoare triple {315299#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 170: Hoare triple {315299#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 171: Hoare triple {315299#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 172: Hoare triple {315299#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 173: Hoare triple {315299#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 174: Hoare triple {315299#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 175: Hoare triple {315299#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 176: Hoare triple {315299#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 177: Hoare triple {315299#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 178: Hoare triple {315299#false} assume 4400 == #t~mem52;havoc #t~mem52; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 179: Hoare triple {315299#false} call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(#t~mem90.base, 888 + #t~mem90.offset, 8);call #t~mem92 := read~int(#t~mem91.base, 20 + #t~mem91.offset, 8); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 180: Hoare triple {315299#false} assume 0 != (if 0 == #t~mem92 then 0 else (if 1 == #t~mem92 then 0 else ~bitwiseAnd(#t~mem92, 256))) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset;havoc #t~mem92;~skip~0 := 1; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 181: Hoare triple {315299#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 182: Hoare triple {315299#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 183: Hoare triple {315299#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 184: Hoare triple {315299#false} ~skip~0 := 0; {315299#false} is VALID [2022-04-28 15:26:26,430 INFO L290 TraceCheckUtils]: 185: Hoare triple {315299#false} assume !false; {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 186: Hoare triple {315299#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 187: Hoare triple {315299#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 188: Hoare triple {315299#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 189: Hoare triple {315299#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 190: Hoare triple {315299#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 191: Hoare triple {315299#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 192: Hoare triple {315299#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 193: Hoare triple {315299#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 194: Hoare triple {315299#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 195: Hoare triple {315299#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 196: Hoare triple {315299#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 197: Hoare triple {315299#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 198: Hoare triple {315299#false} assume 4416 == #t~mem54;havoc #t~mem54; {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 199: Hoare triple {315299#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 200: Hoare triple {315299#false} assume !(3 == ~blastFlag~0); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 201: Hoare triple {315299#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet95 && #t~nondet95 <= 2147483647;~tmp___6~0 := #t~nondet95;havoc #t~nondet95; {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 202: Hoare triple {315299#false} assume !(0 == ~tmp___6~0); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 203: Hoare triple {315299#false} call #t~mem148.base, #t~mem148.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem149 := read~int(#t~mem148.base, 908 + #t~mem148.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,431 INFO L290 TraceCheckUtils]: 204: Hoare triple {315299#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 205: Hoare triple {315299#false} ~skip~0 := 0; {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 206: Hoare triple {315299#false} assume !false; {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 207: Hoare triple {315299#false} call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem42;havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 208: Hoare triple {315299#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 209: Hoare triple {315299#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 210: Hoare triple {315299#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 211: Hoare triple {315299#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 212: Hoare triple {315299#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 213: Hoare triple {315299#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 214: Hoare triple {315299#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 215: Hoare triple {315299#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 216: Hoare triple {315299#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 217: Hoare triple {315299#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 218: Hoare triple {315299#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 219: Hoare triple {315299#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 220: Hoare triple {315299#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 221: Hoare triple {315299#false} assume 4432 == #t~mem56;havoc #t~mem56; {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 222: Hoare triple {315299#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 223: Hoare triple {315299#false} assume 5 == ~blastFlag~0; {315299#false} is VALID [2022-04-28 15:26:26,432 INFO L290 TraceCheckUtils]: 224: Hoare triple {315299#false} assume !false; {315299#false} is VALID [2022-04-28 15:26:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-28 15:26:26,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:26,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029845885] [2022-04-28 15:26:26,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029845885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:26,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:26,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:26,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:26,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440990746] [2022-04-28 15:26:26,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440990746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:26,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:26,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886110062] [2022-04-28 15:26:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:26,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 225 [2022-04-28 15:26:26,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:26,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:26,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:26,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:26,508 INFO L87 Difference]: Start difference. First operand 2558 states and 3637 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:28,531 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-28 15:26:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:30,975 INFO L93 Difference]: Finished difference Result 5676 states and 8063 transitions. [2022-04-28 15:26:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:30,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 225 [2022-04-28 15:26:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 15:26:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 15:26:30,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 15:26:31,278 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-28 15:26:31,711 INFO L225 Difference]: With dead ends: 5676 [2022-04-28 15:26:31,711 INFO L226 Difference]: Without dead ends: 3134 [2022-04-28 15:26:31,714 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-28 15:26:31,714 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 108 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:31,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:26:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2022-04-28 15:26:31,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2558. [2022-04-28 15:26:31,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:31,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3134 states. Second operand has 2558 states, 2553 states have (on average 1.4042303172737955) internal successors, (3585), 2553 states have internal predecessors, (3585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:31,915 INFO L74 IsIncluded]: Start isIncluded. First operand 3134 states. Second operand has 2558 states, 2553 states have (on average 1.4042303172737955) internal successors, (3585), 2553 states have internal predecessors, (3585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:31,916 INFO L87 Difference]: Start difference. First operand 3134 states. Second operand has 2558 states, 2553 states have (on average 1.4042303172737955) internal successors, (3585), 2553 states have internal predecessors, (3585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:32,179 INFO L93 Difference]: Finished difference Result 3134 states and 4398 transitions. [2022-04-28 15:26:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 4398 transitions. [2022-04-28 15:26:32,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:32,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:32,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 2558 states, 2553 states have (on average 1.4042303172737955) internal successors, (3585), 2553 states have internal predecessors, (3585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3134 states. [2022-04-28 15:26:32,186 INFO L87 Difference]: Start difference. First operand has 2558 states, 2553 states have (on average 1.4042303172737955) internal successors, (3585), 2553 states have internal predecessors, (3585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3134 states. [2022-04-28 15:26:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:32,457 INFO L93 Difference]: Finished difference Result 3134 states and 4398 transitions. [2022-04-28 15:26:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 4398 transitions. [2022-04-28 15:26:32,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:32,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:32,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:32,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2553 states have (on average 1.4042303172737955) internal successors, (3585), 2553 states have internal predecessors, (3585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3589 transitions. [2022-04-28 15:26:32,755 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3589 transitions. Word has length 225 [2022-04-28 15:26:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:32,755 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3589 transitions. [2022-04-28 15:26:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:32,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2558 states and 3589 transitions.