/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.04.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:15:26,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:15:26,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:15:26,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:15:26,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:15:26,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:15:26,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:15:26,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:15:26,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:15:26,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:15:26,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:15:26,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:15:26,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:15:26,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:15:26,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:15:26,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:15:26,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:15:26,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:15:26,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:15:26,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:15:26,363 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:15:26,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:15:26,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:15:26,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:15:26,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:15:26,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:15:26,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:15:26,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:15:26,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:15:26,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:15:26,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:15:26,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:15:26,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:15:26,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:15:26,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:15:26,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:15:26,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:15:26,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:15:26,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:15:26,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:15:26,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:15:26,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:15:26,382 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:15:26,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:15:26,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:15:26,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:15:26,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:15:26,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:15:26,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:15:26,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:15:26,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:15:26,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:15:26,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:15:26,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:15:26,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:15:26,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:15:26,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:15:26,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:15:26,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:15:26,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:15:26,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:15:26,398 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:15:26,398 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:15:26,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:15:26,398 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:15:26,398 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:15:26,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:15:26,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:15:26,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:15:26,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:15:26,635 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:15:26,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-28 15:15:26,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90183642/bb9eac669110467bbd2e69053db4266f/FLAG730bb6df5 [2022-04-28 15:15:27,148 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:15:27,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-28 15:15:27,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90183642/bb9eac669110467bbd2e69053db4266f/FLAG730bb6df5 [2022-04-28 15:15:27,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90183642/bb9eac669110467bbd2e69053db4266f [2022-04-28 15:15:27,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:15:27,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:15:27,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:15:27,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:15:27,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:15:27,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f89b098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27, skipping insertion in model container [2022-04-28 15:15:27,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:15:27,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:15:27,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c[65405,65418] [2022-04-28 15:15:27,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:15:27,701 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:15:27,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c[65405,65418] [2022-04-28 15:15:27,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:15:27,835 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:15:27,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27 WrapperNode [2022-04-28 15:15:27,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:15:27,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:15:27,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:15:27,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:15:27,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:15:27,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:15:27,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:15:27,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:15:27,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 15:15:27,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:15:27,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:15:27,988 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:15:28,013 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:15:28,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:15:28,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:15:28,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:15:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-28 15:15:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-28 15:15:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:15:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-28 15:15:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:15:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:15:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:15:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:15:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:15:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:15:28,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:15:28,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-28 15:15:28,039 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:15:28,040 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:15:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:15:28,197 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:15:28,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:15:29,709 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:15:30,216 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-28 15:15:30,216 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-28 15:15:30,227 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:15:30,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:15:30,234 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:15:30,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:15:30 BoogieIcfgContainer [2022-04-28 15:15:30,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:15:30,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:15:30,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:15:30,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:15:30,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:15:27" (1/3) ... [2022-04-28 15:15:30,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a5e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:15:30, skipping insertion in model container [2022-04-28 15:15:30,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (2/3) ... [2022-04-28 15:15:30,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a5e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:15:30, skipping insertion in model container [2022-04-28 15:15:30,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:15:30" (3/3) ... [2022-04-28 15:15:30,242 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-28 15:15:30,253 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:15:30,254 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:15:30,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:15:30,307 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@1572e2b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@365b3583 [2022-04-28 15:15:30,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:15:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 15:15:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:15:30,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:30,325 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:15:30,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-28 15:15:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:30,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320932605] [2022-04-28 15:15:30,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:15:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-28 15:15:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:30,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196839275] [2022-04-28 15:15:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:30,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {141#true} is VALID [2022-04-28 15:15:30,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 15:15:30,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 15:15:30,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:15:30,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(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); {141#true} is VALID [2022-04-28 15:15:30,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-28 15:15:30,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-28 15:15:30,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-28 15:15:30,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#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; {141#true} is VALID [2022-04-28 15:15:30,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-28 15:15:30,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:15:30,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:15:30,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:15:30,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 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)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:15:30,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:15:30,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-28 15:15:30,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-28 15:15:30,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-28 15:15:30,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-28 15:15:30,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-28 15:15:30,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-28 15:15:30,999 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:15:31,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:31,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196839275] [2022-04-28 15:15:31,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196839275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:31,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:31,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:31,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320932605] [2022-04-28 15:15:31,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320932605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:31,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:31,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137132680] [2022-04-28 15:15:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:31,012 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:15:31,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:31,018 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:15:31,059 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:15:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:15:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:15:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:15:31,089 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:36,084 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:15:38,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:15:40,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:15:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:41,464 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-28 15:15:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:15:41,471 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:15:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:41,472 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:15:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 15:15:41,493 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:15:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-28 15:15:41,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-28 15:15:41,930 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:15:41,940 INFO L225 Difference]: With dead ends: 267 [2022-04-28 15:15:41,940 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 15:15:41,943 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:15:41,945 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:41,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-28 15:15:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 15:15:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-28 15:15:41,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:41,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:41,981 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:41,982 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:41,988 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 15:15:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 15:15:41,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:41,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:41,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 15:15:41,991 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 15:15:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:41,996 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-28 15:15:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-28 15:15:41,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:41,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:41,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:41,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-28 15:15:42,004 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-28 15:15:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:42,005 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-28 15:15:42,005 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:15:42,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-28 15:15:42,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-28 15:15:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 15:15:42,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:42,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:15:42,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:15:42,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-28 15:15:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:42,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045030609] [2022-04-28 15:15:42,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:15:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-28 15:15:42,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:42,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316995586] [2022-04-28 15:15:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:42,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(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); {1173#true} is VALID [2022-04-28 15:15:42,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 15:15:42,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 15:15:42,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(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:42,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(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); {1173#true} is VALID [2022-04-28 15:15:42,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-28 15:15:42,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-28 15:15:42,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-28 15:15:42,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#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; {1173#true} is VALID [2022-04-28 15:15:42,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-28 15:15:42,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= 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)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= 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~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-28 15:15:42,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-28 15:15:42,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-28 15:15:42,499 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:15:42,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316995586] [2022-04-28 15:15:42,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316995586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:42,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:42,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:15:42,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045030609] [2022-04-28 15:15:42,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045030609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:42,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:42,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:15:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922319690] [2022-04-28 15:15:42,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 15:15:42,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:42,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:42,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:42,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:15:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:42,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:15:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:15:42,544 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:44,568 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:15:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:45,335 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-28 15:15:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:15:45,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 15:15:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 15:15:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 15:15:45,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-28 15:15:45,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:45,755 INFO L225 Difference]: With dead ends: 327 [2022-04-28 15:15:45,755 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 15:15:45,756 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:15:45,757 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:45,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:15:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 15:15:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-28 15:15:45,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:45,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,773 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,774 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:45,782 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-28 15:15:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 15:15:45,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:45,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:45,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-28 15:15:45,785 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-28 15:15:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:45,793 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-28 15:15:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 15:15:45,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:45,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:45,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:45,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-28 15:15:45,804 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-28 15:15:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:45,804 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-28 15:15:45,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:45,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-28 15:15:46,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-28 15:15:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 15:15:46,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:46,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:15:46,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:15:46,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-28 15:15:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:46,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826314632] [2022-04-28 15:15:46,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:15:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-28 15:15:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:46,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708278477] [2022-04-28 15:15:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:46,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:46,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(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); {2724#true} is VALID [2022-04-28 15:15:46,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-28 15:15:46,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-28 15:15:46,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(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:46,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(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); {2724#true} is VALID [2022-04-28 15:15:46,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-28 15:15:46,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-28 15:15:46,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-28 15:15:46,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#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; {2724#true} is VALID [2022-04-28 15:15:46,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-28 15:15:46,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2724#true} is VALID [2022-04-28 15:15:46,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2724#true} is VALID [2022-04-28 15:15:46,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {2724#true} is VALID [2022-04-28 15:15:46,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-28 15:15:46,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-28 15:15:46,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-28 15:15:46,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2724#true} is VALID [2022-04-28 15:15:46,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2724#true} is VALID [2022-04-28 15:15:46,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2724#true} is VALID [2022-04-28 15:15:46,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-28 15:15:46,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-28 15:15:46,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-28 15:15:46,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-28 15:15:46,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-28 15:15:46,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2724#true} is VALID [2022-04-28 15:15:46,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-28 15:15:46,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2724#true} is VALID [2022-04-28 15:15:46,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-28 15:15:46,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,331 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:15:46,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2730#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-28 15:15:46,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {2730#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-28 15:15:46,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-28 15:15:46,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-28 15:15:46,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-28 15:15:46,336 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:15:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:46,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708278477] [2022-04-28 15:15:46,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708278477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:46,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:46,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:46,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:46,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826314632] [2022-04-28 15:15:46,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826314632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:46,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:46,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049761559] [2022-04-28 15:15:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:46,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 15:15:46,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:46,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:46,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:46,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:15:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:46,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:15:46,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:15:46,398 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:48,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:15:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:49,684 INFO L93 Difference]: Finished difference Result 611 states and 908 transitions. [2022-04-28 15:15:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:15:49,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 15:15:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:15:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:15:49,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 15:15:50,070 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:15:50,082 INFO L225 Difference]: With dead ends: 611 [2022-04-28 15:15:50,082 INFO L226 Difference]: Without dead ends: 405 [2022-04-28 15:15:50,084 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:50,085 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:50,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 279 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:15:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-28 15:15:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 270. [2022-04-28 15:15:50,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:50,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call 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:50,109 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call 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:50,110 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call 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:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:50,124 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-28 15:15:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-28 15:15:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:50,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 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 405 states. [2022-04-28 15:15:50,127 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 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 405 states. [2022-04-28 15:15:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:50,141 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-04-28 15:15:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 600 transitions. [2022-04-28 15:15:50,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:50,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:50,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:50,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 3 states have call successors, (3), 3 states have call 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:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2022-04-28 15:15:50,152 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 410 transitions. Word has length 59 [2022-04-28 15:15:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:50,152 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 410 transitions. [2022-04-28 15:15:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:50,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 410 transitions. [2022-04-28 15:15:50,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 410 transitions. [2022-04-28 15:15:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 15:15:50,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:50,474 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] [2022-04-28 15:15:50,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:15:50,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:50,475 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 1 times [2022-04-28 15:15:50,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:50,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057030518] [2022-04-28 15:15:50,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:15:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -949350737, now seen corresponding path program 2 times [2022-04-28 15:15:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:50,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542615626] [2022-04-28 15:15:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:50,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {5315#(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); {5308#true} is VALID [2022-04-28 15:15:50,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-28 15:15:50,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-28 15:15:50,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {5308#true} call ULTIMATE.init(); {5315#(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:50,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {5315#(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); {5308#true} is VALID [2022-04-28 15:15:50,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {5308#true} assume true; {5308#true} is VALID [2022-04-28 15:15:50,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5308#true} {5308#true} #593#return; {5308#true} is VALID [2022-04-28 15:15:50,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {5308#true} call #t~ret158 := main(); {5308#true} is VALID [2022-04-28 15:15:50,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {5308#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; {5308#true} is VALID [2022-04-28 15:15:50,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {5308#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {5308#true} is VALID [2022-04-28 15:15:50,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {5308#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5308#true} is VALID [2022-04-28 15:15:50,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {5308#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {5308#true} is VALID [2022-04-28 15:15:50,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {5308#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {5308#true} assume 12292 == #t~mem49;havoc #t~mem49; {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {5308#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {5308#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {5308#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {5308#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {5308#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#true} assume !(0 == ~tmp___4~0); {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {5308#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {5308#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {5308#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5308#true} is VALID [2022-04-28 15:15:50,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {5308#true} ~skip~0 := 0; {5308#true} is VALID [2022-04-28 15:15:50,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {5308#true} assume !false; {5308#true} is VALID [2022-04-28 15:15:50,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {5308#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {5308#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {5308#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {5308#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {5308#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {5308#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5308#true} is VALID [2022-04-28 15:15:50,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {5308#true} assume 4368 == #t~mem54;havoc #t~mem54; {5308#true} is VALID [2022-04-28 15:15:50,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {5308#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {5308#true} is VALID [2022-04-28 15:15:50,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {5308#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5308#true} is VALID [2022-04-28 15:15:50,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {5308#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-28 15:15:50,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {5313#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5314#(not (= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-28 15:15:50,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {5314#(not (= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {5309#false} is VALID [2022-04-28 15:15:50,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {5309#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {5309#false} is VALID [2022-04-28 15:15:50,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {5309#false} assume 5 == ~blastFlag~0; {5309#false} is VALID [2022-04-28 15:15:50,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {5309#false} assume !false; {5309#false} is VALID [2022-04-28 15:15:50,734 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:15:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542615626] [2022-04-28 15:15:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542615626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:50,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:50,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:50,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057030518] [2022-04-28 15:15:50,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057030518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:50,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:50,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457156601] [2022-04-28 15:15:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:50,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 15:15:50,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:50,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:50,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:50,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:15:50,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:50,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:15:50,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:15:50,792 INFO L87 Difference]: Start difference. First operand 270 states and 410 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:52,820 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:15:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:53,981 INFO L93 Difference]: Finished difference Result 707 states and 1076 transitions. [2022-04-28 15:15:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:15:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 15:15:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:15:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:15:53,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 15:15:54,366 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:15:54,381 INFO L225 Difference]: With dead ends: 707 [2022-04-28 15:15:54,381 INFO L226 Difference]: Without dead ends: 453 [2022-04-28 15:15:54,383 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:54,386 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:54,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:15:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-28 15:15:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 320. [2022-04-28 15:15:54,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:54,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call 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:54,419 INFO L74 IsIncluded]: Start isIncluded. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call 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:54,420 INFO L87 Difference]: Start difference. First operand 453 states. Second operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call 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:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:54,459 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-28 15:15:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-28 15:15:54,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:54,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:54,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 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 453 states. [2022-04-28 15:15:54,462 INFO L87 Difference]: Start difference. First operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 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 453 states. [2022-04-28 15:15:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:54,483 INFO L93 Difference]: Finished difference Result 453 states and 684 transitions. [2022-04-28 15:15:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 684 transitions. [2022-04-28 15:15:54,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:54,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:54,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:54,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.5682539682539682) internal successors, (494), 315 states have internal predecessors, (494), 3 states have call successors, (3), 3 states have call 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:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 498 transitions. [2022-04-28 15:15:54,494 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 498 transitions. Word has length 60 [2022-04-28 15:15:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:54,495 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 498 transitions. [2022-04-28 15:15:54,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:54,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 320 states and 498 transitions. [2022-04-28 15:15:54,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 498 transitions. [2022-04-28 15:15:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 15:15:54,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:54,904 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] [2022-04-28 15:15:54,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:15:54,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 1 times [2022-04-28 15:15:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7420845] [2022-04-28 15:15:54,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:15:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1308079053, now seen corresponding path program 2 times [2022-04-28 15:15:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:54,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141444949] [2022-04-28 15:15:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:55,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {8286#(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); {8280#true} is VALID [2022-04-28 15:15:55,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-28 15:15:55,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-28 15:15:55,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {8280#true} call ULTIMATE.init(); {8286#(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:55,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {8286#(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); {8280#true} is VALID [2022-04-28 15:15:55,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {8280#true} assume true; {8280#true} is VALID [2022-04-28 15:15:55,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8280#true} {8280#true} #593#return; {8280#true} is VALID [2022-04-28 15:15:55,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {8280#true} call #t~ret158 := main(); {8280#true} is VALID [2022-04-28 15:15:55,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {8280#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; {8280#true} is VALID [2022-04-28 15:15:55,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {8280#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {8280#true} is VALID [2022-04-28 15:15:55,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {8280#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8280#true} is VALID [2022-04-28 15:15:55,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {8280#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {8280#true} is VALID [2022-04-28 15:15:55,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {8280#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {8280#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {8280#true} assume 12292 == #t~mem49;havoc #t~mem49; {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {8280#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {8280#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {8280#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8280#true} is VALID [2022-04-28 15:15:55,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {8280#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {8280#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8280#true} is VALID [2022-04-28 15:15:55,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {8280#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {8280#true} is VALID [2022-04-28 15:15:55,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {8280#true} assume !(0 == ~tmp___4~0); {8280#true} is VALID [2022-04-28 15:15:55,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {8280#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {8280#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {8280#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8280#true} is VALID [2022-04-28 15:15:55,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {8280#true} ~skip~0 := 0; {8280#true} is VALID [2022-04-28 15:15:55,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {8280#true} assume !false; {8280#true} is VALID [2022-04-28 15:15:55,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {8280#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {8280#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {8280#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {8280#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {8280#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {8280#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8280#true} is VALID [2022-04-28 15:15:55,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {8280#true} assume 4368 == #t~mem54;havoc #t~mem54; {8280#true} is VALID [2022-04-28 15:15:55,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {8280#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {8280#true} is VALID [2022-04-28 15:15:55,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {8280#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {8285#(= 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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,142 INFO L290 TraceCheckUtils]: 45: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,143 INFO L290 TraceCheckUtils]: 46: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 4416 == #t~mem60;havoc #t~mem60; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {8285#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-28 15:15:55,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {8285#(= ssl3_connect_~blastFlag~0 1)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {8281#false} is VALID [2022-04-28 15:15:55,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {8281#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); {8281#false} is VALID [2022-04-28 15:15:55,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {8281#false} assume !(0 == ~tmp___6~0); {8281#false} is VALID [2022-04-28 15:15:55,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {8281#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {8281#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8281#false} is VALID [2022-04-28 15:15:55,150 INFO L290 TraceCheckUtils]: 60: Hoare triple {8281#false} ~skip~0 := 0; {8281#false} is VALID [2022-04-28 15:15:55,150 INFO L290 TraceCheckUtils]: 61: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-28 15:15:55,150 INFO L290 TraceCheckUtils]: 62: Hoare triple {8281#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,150 INFO L290 TraceCheckUtils]: 63: Hoare triple {8281#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {8281#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {8281#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,151 INFO L290 TraceCheckUtils]: 66: Hoare triple {8281#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,151 INFO L290 TraceCheckUtils]: 67: Hoare triple {8281#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,151 INFO L290 TraceCheckUtils]: 68: Hoare triple {8281#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,151 INFO L290 TraceCheckUtils]: 69: Hoare triple {8281#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {8281#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {8281#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {8281#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {8281#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {8281#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {8281#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8281#false} is VALID [2022-04-28 15:15:55,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {8281#false} assume 4432 == #t~mem62;havoc #t~mem62; {8281#false} is VALID [2022-04-28 15:15:55,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {8281#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {8281#false} is VALID [2022-04-28 15:15:55,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {8281#false} assume 5 == ~blastFlag~0; {8281#false} is VALID [2022-04-28 15:15:55,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {8281#false} assume !false; {8281#false} is VALID [2022-04-28 15:15:55,155 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:15:55,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:55,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141444949] [2022-04-28 15:15:55,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141444949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:55,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:55,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:15:55,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:55,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7420845] [2022-04-28 15:15:55,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7420845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:55,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:55,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:15:55,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297916514] [2022-04-28 15:15:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 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 80 [2022-04-28 15:15:55,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:55,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call 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:55,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:15:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:15:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:15:55,228 INFO L87 Difference]: Start difference. First operand 320 states and 498 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call 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:57,251 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:15:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:58,405 INFO L93 Difference]: Finished difference Result 623 states and 981 transitions. [2022-04-28 15:15:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:15:58,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 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 80 [2022-04-28 15:15:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call 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:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-28 15:15:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call 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:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-28 15:15:58,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-28 15:15:58,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:58,822 INFO L225 Difference]: With dead ends: 623 [2022-04-28 15:15:58,822 INFO L226 Difference]: Without dead ends: 469 [2022-04-28 15:15:58,823 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:15:58,824 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:15:58,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 470 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:15:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-28 15:15:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-04-28 15:15:58,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:15:58,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call 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:58,848 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call 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:58,869 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call 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:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:58,884 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-28 15:15:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-28 15:15:58,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:58,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:58,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 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 469 states. [2022-04-28 15:15:58,887 INFO L87 Difference]: Start difference. First operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 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 469 states. [2022-04-28 15:15:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:58,901 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2022-04-28 15:15:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-28 15:15:58,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:15:58,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:15:58,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:15:58,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:15:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 464 states have (on average 1.5668103448275863) internal successors, (727), 464 states have internal predecessors, (727), 3 states have call successors, (3), 3 states have call 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:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-04-28 15:15:58,930 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 80 [2022-04-28 15:15:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:15:58,930 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-04-28 15:15:58,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call 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:58,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 731 transitions. [2022-04-28 15:15:59,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-04-28 15:15:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 15:15:59,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:59,545 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-28 15:15:59,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:15:59,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 1 times [2022-04-28 15:15:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801516529] [2022-04-28 15:15:59,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:15:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1829686905, now seen corresponding path program 2 times [2022-04-28 15:15:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:59,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45421531] [2022-04-28 15:15:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:59,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {11417#(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); {11411#true} is VALID [2022-04-28 15:15:59,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-28 15:15:59,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-28 15:15:59,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {11411#true} call ULTIMATE.init(); {11417#(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:59,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {11417#(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); {11411#true} is VALID [2022-04-28 15:15:59,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {11411#true} assume true; {11411#true} is VALID [2022-04-28 15:15:59,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11411#true} {11411#true} #593#return; {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {11411#true} call #t~ret158 := main(); {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {11411#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; {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L272 TraceCheckUtils]: 6: Hoare triple {11411#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {11411#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {11411#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {11411#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {11411#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11411#true} is VALID [2022-04-28 15:15:59,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-28 15:15:59,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {11411#true} assume 12292 == #t~mem49;havoc #t~mem49; {11411#true} is VALID [2022-04-28 15:15:59,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {11411#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11411#true} is VALID [2022-04-28 15:15:59,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {11411#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {11411#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11411#true} is VALID [2022-04-28 15:15:59,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {11411#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {11411#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {11411#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {11411#true} assume !(0 == ~tmp___4~0); {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {11411#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {11411#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {11411#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-28 15:15:59,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {11411#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {11411#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {11411#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {11411#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {11411#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {11411#true} assume 4368 == #t~mem54;havoc #t~mem54; {11411#true} is VALID [2022-04-28 15:15:59,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {11411#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {11411#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {11411#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {11411#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {11411#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {11411#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {11411#true} ~skip~0 := 0; {11411#true} is VALID [2022-04-28 15:15:59,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {11411#true} assume !false; {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {11411#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {11411#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {11411#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {11411#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {11411#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {11411#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {11411#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {11411#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11411#true} is VALID [2022-04-28 15:15:59,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {11411#true} assume 4384 == #t~mem56;havoc #t~mem56; {11411#true} is VALID [2022-04-28 15:15:59,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {11411#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11411#true} is VALID [2022-04-28 15:15:59,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {11411#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,835 INFO L290 TraceCheckUtils]: 62: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,835 INFO L290 TraceCheckUtils]: 63: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {11416#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:15:59,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {11416#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11412#false} is VALID [2022-04-28 15:15:59,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {11412#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); {11412#false} is VALID [2022-04-28 15:15:59,840 INFO L290 TraceCheckUtils]: 75: Hoare triple {11412#false} assume !(0 == ~tmp___6~0); {11412#false} is VALID [2022-04-28 15:15:59,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {11412#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {11412#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11412#false} is VALID [2022-04-28 15:15:59,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {11412#false} ~skip~0 := 0; {11412#false} is VALID [2022-04-28 15:15:59,843 INFO L290 TraceCheckUtils]: 79: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-28 15:15:59,844 INFO L290 TraceCheckUtils]: 80: Hoare triple {11412#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,844 INFO L290 TraceCheckUtils]: 81: Hoare triple {11412#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,844 INFO L290 TraceCheckUtils]: 82: Hoare triple {11412#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {11412#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 84: Hoare triple {11412#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {11412#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {11412#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 87: Hoare triple {11412#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 88: Hoare triple {11412#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 89: Hoare triple {11412#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,845 INFO L290 TraceCheckUtils]: 90: Hoare triple {11412#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {11412#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {11412#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {11412#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 94: Hoare triple {11412#false} assume 4432 == #t~mem62;havoc #t~mem62; {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {11412#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 96: Hoare triple {11412#false} assume 5 == ~blastFlag~0; {11412#false} is VALID [2022-04-28 15:15:59,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {11412#false} assume !false; {11412#false} is VALID [2022-04-28 15:15:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 15:15:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:59,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45421531] [2022-04-28 15:15:59,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45421531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:59,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:59,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:15:59,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:59,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801516529] [2022-04-28 15:15:59,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801516529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:59,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:59,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:15:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142402] [2022-04-28 15:15:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:59,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 15:15:59,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:59,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:59,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:59,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:15:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:15:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:15:59,926 INFO L87 Difference]: Start difference. First operand 469 states and 731 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:01,948 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:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:03,074 INFO L93 Difference]: Finished difference Result 922 states and 1448 transitions. [2022-04-28 15:16:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 15:16:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 15:16:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-28 15:16:03,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-28 15:16:03,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:03,508 INFO L225 Difference]: With dead ends: 922 [2022-04-28 15:16:03,508 INFO L226 Difference]: Without dead ends: 619 [2022-04-28 15:16:03,509 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:03,510 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:03,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-28 15:16:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-28 15:16:03,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:03,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call 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,537 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call 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,538 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call 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,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:03,558 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-28 15:16:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-28 15:16:03,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:03,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:03,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-28 15:16:03,563 INFO L87 Difference]: Start difference. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-28 15:16:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:03,584 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-28 15:16:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-28 15:16:03,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:03,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:03,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:03,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call 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,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-28 15:16:03,616 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-28 15:16:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:03,617 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-28 15:16:03,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:03,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-28 15:16:04,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-28 15:16:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 15:16:04,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:04,421 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:04,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:16:04,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-28 15:16:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:04,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658965033] [2022-04-28 15:16:04,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-28 15:16:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:04,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279994014] [2022-04-28 15:16:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:04,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {15746#(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); {15740#true} is VALID [2022-04-28 15:16:04,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-28 15:16:04,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-28 15:16:04,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {15740#true} call ULTIMATE.init(); {15746#(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:04,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {15746#(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); {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {15740#true} assume true; {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15740#true} {15740#true} #593#return; {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {15740#true} call #t~ret158 := main(); {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {15740#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; {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {15740#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {15740#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {15740#true} is VALID [2022-04-28 15:16:04,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {15740#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {15740#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {15740#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {15740#true} assume 12292 == #t~mem49;havoc #t~mem49; {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {15740#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {15740#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {15740#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {15740#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {15740#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {15740#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {15740#true} assume !(0 == ~tmp___4~0); {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {15740#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {15740#true} assume 4368 == #t~mem54;havoc #t~mem54; {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {15740#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {15740#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {15740#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {15740#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-28 15:16:04,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {15740#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {15740#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {15740#true} assume 4384 == #t~mem56;havoc #t~mem56; {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {15740#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {15740#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {15740#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {15740#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {15740#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-28 15:16:04,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-28 15:16:04,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-28 15:16:04,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {15740#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {15740#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {15740#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,636 INFO L290 TraceCheckUtils]: 68: Hoare triple {15740#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,636 INFO L290 TraceCheckUtils]: 69: Hoare triple {15740#true} assume 4400 == #t~mem58;havoc #t~mem58; {15740#true} is VALID [2022-04-28 15:16:04,636 INFO L290 TraceCheckUtils]: 70: Hoare triple {15740#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {15740#true} is VALID [2022-04-28 15:16:04,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {15740#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {15740#true} is VALID [2022-04-28 15:16:04,636 INFO L290 TraceCheckUtils]: 72: Hoare triple {15740#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {15740#true} is VALID [2022-04-28 15:16:04,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {15740#true} assume !(~ret~0 <= 0); {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 74: Hoare triple {15740#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {15740#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {15740#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {15740#true} ~skip~0 := 0; {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 78: Hoare triple {15740#true} assume !false; {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 79: Hoare triple {15740#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,637 INFO L290 TraceCheckUtils]: 80: Hoare triple {15740#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {15740#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {15740#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {15740#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {15740#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {15740#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {15740#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,638 INFO L290 TraceCheckUtils]: 87: Hoare triple {15740#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {15740#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,639 INFO L290 TraceCheckUtils]: 89: Hoare triple {15740#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {15740#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15740#true} is VALID [2022-04-28 15:16:04,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {15740#true} assume 4416 == #t~mem60;havoc #t~mem60; {15740#true} is VALID [2022-04-28 15:16:04,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {15740#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {15740#true} is VALID [2022-04-28 15:16:04,640 INFO L290 TraceCheckUtils]: 93: Hoare triple {15740#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,640 INFO L290 TraceCheckUtils]: 94: Hoare triple {15745#(= 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); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,640 INFO L290 TraceCheckUtils]: 95: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,641 INFO L290 TraceCheckUtils]: 97: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,641 INFO L290 TraceCheckUtils]: 98: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,642 INFO L290 TraceCheckUtils]: 99: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !false; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,642 INFO L290 TraceCheckUtils]: 100: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,642 INFO L290 TraceCheckUtils]: 101: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,643 INFO L290 TraceCheckUtils]: 102: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,643 INFO L290 TraceCheckUtils]: 103: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,643 INFO L290 TraceCheckUtils]: 104: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,644 INFO L290 TraceCheckUtils]: 106: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,644 INFO L290 TraceCheckUtils]: 107: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,645 INFO L290 TraceCheckUtils]: 108: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,645 INFO L290 TraceCheckUtils]: 109: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,645 INFO L290 TraceCheckUtils]: 110: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,646 INFO L290 TraceCheckUtils]: 111: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,646 INFO L290 TraceCheckUtils]: 112: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,646 INFO L290 TraceCheckUtils]: 113: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,647 INFO L290 TraceCheckUtils]: 114: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,647 INFO L290 TraceCheckUtils]: 115: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15745#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-28 15:16:04,647 INFO L290 TraceCheckUtils]: 116: Hoare triple {15745#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {15741#false} is VALID [2022-04-28 15:16:04,647 INFO L290 TraceCheckUtils]: 117: Hoare triple {15741#false} assume !false; {15741#false} is VALID [2022-04-28 15:16:04,648 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:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:04,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279994014] [2022-04-28 15:16:04,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279994014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:04,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:04,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:04,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:04,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658965033] [2022-04-28 15:16:04,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658965033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:04,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:04,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040041800] [2022-04-28 15:16:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:04,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:16:04,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:04,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:04,717 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:16:04,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:16:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:04,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:16:04,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:16:04,719 INFO L87 Difference]: Start difference. First operand 619 states and 966 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,739 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:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:07,841 INFO L93 Difference]: Finished difference Result 1223 states and 1920 transitions. [2022-04-28 15:16:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-28 15:16:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 15:16:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-28 15:16:07,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-28 15:16:08,249 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:16:08,291 INFO L225 Difference]: With dead ends: 1223 [2022-04-28 15:16:08,291 INFO L226 Difference]: Without dead ends: 770 [2022-04-28 15:16:08,292 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:08,293 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:08,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 478 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-28 15:16:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-04-28 15:16:08,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:08,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call 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,325 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call 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,327 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call 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,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:08,366 INFO L93 Difference]: Finished difference Result 770 states and 1202 transitions. [2022-04-28 15:16:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-28 15:16:08,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:08,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:08,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 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 770 states. [2022-04-28 15:16:08,372 INFO L87 Difference]: Start difference. First operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 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 770 states. [2022-04-28 15:16:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:08,402 INFO L93 Difference]: Finished difference Result 770 states and 1202 transitions. [2022-04-28 15:16:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-28 15:16:08,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:08,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:08,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:08,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 765 states have (on average 1.5660130718954248) internal successors, (1198), 765 states have internal predecessors, (1198), 3 states have call successors, (3), 3 states have call 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,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1202 transitions. [2022-04-28 15:16:08,447 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1202 transitions. Word has length 118 [2022-04-28 15:16:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:08,447 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1202 transitions. [2022-04-28 15:16:08,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:08,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 770 states and 1202 transitions. [2022-04-28 15:16:09,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1202 edges. 1202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1202 transitions. [2022-04-28 15:16:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 15:16:09,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:09,364 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:09,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:16:09,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203673, now seen corresponding path program 1 times [2022-04-28 15:16:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:09,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36407003] [2022-04-28 15:16:09,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1249203673, now seen corresponding path program 2 times [2022-04-28 15:16:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:09,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849342321] [2022-04-28 15:16:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:09,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {21281#(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); {21275#true} is VALID [2022-04-28 15:16:09,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {21275#true} assume true; {21275#true} is VALID [2022-04-28 15:16:09,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21275#true} {21275#true} #593#return; {21275#true} is VALID [2022-04-28 15:16:09,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {21275#true} call ULTIMATE.init(); {21281#(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:09,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {21281#(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); {21275#true} is VALID [2022-04-28 15:16:09,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {21275#true} assume true; {21275#true} is VALID [2022-04-28 15:16:09,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21275#true} {21275#true} #593#return; {21275#true} is VALID [2022-04-28 15:16:09,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {21275#true} call #t~ret158 := main(); {21275#true} is VALID [2022-04-28 15:16:09,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {21275#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; {21275#true} is VALID [2022-04-28 15:16:09,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {21275#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21275#true} is VALID [2022-04-28 15:16:09,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {21275#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {21275#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {21275#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {21275#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {21275#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {21275#true} assume 12292 == #t~mem49;havoc #t~mem49; {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {21275#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {21275#true} is VALID [2022-04-28 15:16:09,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {21275#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {21275#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {21275#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {21275#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {21275#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {21275#true} assume !(0 == ~tmp___4~0); {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {21275#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {21275#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {21275#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {21275#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {21275#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {21275#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {21275#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {21275#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {21275#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {21275#true} assume 4368 == #t~mem54;havoc #t~mem54; {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {21275#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {21275#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {21275#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {21275#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {21275#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {21275#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#true} is VALID [2022-04-28 15:16:09,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {21275#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {21275#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {21275#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {21275#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {21275#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {21275#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {21275#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {21275#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {21275#true} assume 4384 == #t~mem56;havoc #t~mem56; {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {21275#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {21275#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {21275#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {21275#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {21275#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {21275#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {21275#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {21275#true} ~skip~0 := 0; {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {21275#true} assume !false; {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {21275#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {21275#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {21275#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {21275#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {21275#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {21275#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {21275#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {21275#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 67: Hoare triple {21275#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 68: Hoare triple {21275#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {21275#true} assume 4400 == #t~mem58;havoc #t~mem58; {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {21275#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {21275#true} is VALID [2022-04-28 15:16:09,571 INFO L290 TraceCheckUtils]: 71: Hoare triple {21275#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21275#true} is VALID [2022-04-28 15:16:09,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {21275#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {21280#(= 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); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,573 INFO L290 TraceCheckUtils]: 76: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,574 INFO L290 TraceCheckUtils]: 77: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,574 INFO L290 TraceCheckUtils]: 78: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,574 INFO L290 TraceCheckUtils]: 79: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,576 INFO L290 TraceCheckUtils]: 83: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,576 INFO L290 TraceCheckUtils]: 84: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,576 INFO L290 TraceCheckUtils]: 85: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,577 INFO L290 TraceCheckUtils]: 86: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,577 INFO L290 TraceCheckUtils]: 87: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,577 INFO L290 TraceCheckUtils]: 88: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,579 INFO L290 TraceCheckUtils]: 92: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {21280#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-28 15:16:09,579 INFO L290 TraceCheckUtils]: 93: Hoare triple {21280#(= 3 ssl3_connect_~blastFlag~0)} assume !(3 == ~blastFlag~0); {21276#false} is VALID [2022-04-28 15:16:09,579 INFO L290 TraceCheckUtils]: 94: Hoare triple {21276#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); {21276#false} is VALID [2022-04-28 15:16:09,579 INFO L290 TraceCheckUtils]: 95: Hoare triple {21276#false} assume !(0 == ~tmp___6~0); {21276#false} is VALID [2022-04-28 15:16:09,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {21276#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 97: Hoare triple {21276#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 98: Hoare triple {21276#false} ~skip~0 := 0; {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 99: Hoare triple {21276#false} assume !false; {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 100: Hoare triple {21276#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 101: Hoare triple {21276#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 102: Hoare triple {21276#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 103: Hoare triple {21276#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,580 INFO L290 TraceCheckUtils]: 104: Hoare triple {21276#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {21276#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 106: Hoare triple {21276#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 107: Hoare triple {21276#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 108: Hoare triple {21276#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 109: Hoare triple {21276#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 110: Hoare triple {21276#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 111: Hoare triple {21276#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,581 INFO L290 TraceCheckUtils]: 112: Hoare triple {21276#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,582 INFO L290 TraceCheckUtils]: 113: Hoare triple {21276#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21276#false} is VALID [2022-04-28 15:16:09,582 INFO L290 TraceCheckUtils]: 114: Hoare triple {21276#false} assume 4432 == #t~mem62;havoc #t~mem62; {21276#false} is VALID [2022-04-28 15:16:09,582 INFO L290 TraceCheckUtils]: 115: Hoare triple {21276#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21276#false} is VALID [2022-04-28 15:16:09,582 INFO L290 TraceCheckUtils]: 116: Hoare triple {21276#false} assume 5 == ~blastFlag~0; {21276#false} is VALID [2022-04-28 15:16:09,582 INFO L290 TraceCheckUtils]: 117: Hoare triple {21276#false} assume !false; {21276#false} is VALID [2022-04-28 15:16:09,583 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:09,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:09,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849342321] [2022-04-28 15:16:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849342321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:09,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:09,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:09,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36407003] [2022-04-28 15:16:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36407003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:09,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:16:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976541071] [2022-04-28 15:16:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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 118 [2022-04-28 15:16:09,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:09,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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:16:09,662 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:16:09,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:16:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:16:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:16:09,664 INFO L87 Difference]: Start difference. First operand 770 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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:16:11,688 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:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:12,809 INFO L93 Difference]: Finished difference Result 1500 states and 2348 transitions. [2022-04-28 15:16:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:16:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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 118 [2022-04-28 15:16:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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:16:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 15:16:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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:16:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-28 15:16:12,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-28 15:16:13,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:13,175 INFO L225 Difference]: With dead ends: 1500 [2022-04-28 15:16:13,175 INFO L226 Difference]: Without dead ends: 896 [2022-04-28 15:16:13,177 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,177 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:13,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-04-28 15:16:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2022-04-28 15:16:13,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:13,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 896 states. Second operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call 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,217 INFO L74 IsIncluded]: Start isIncluded. First operand 896 states. Second operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call 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,219 INFO L87 Difference]: Start difference. First operand 896 states. Second operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call 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,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:13,255 INFO L93 Difference]: Finished difference Result 896 states and 1394 transitions. [2022-04-28 15:16:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-28 15:16:13,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:13,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:13,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 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 896 states. [2022-04-28 15:16:13,261 INFO L87 Difference]: Start difference. First operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 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 896 states. [2022-04-28 15:16:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:13,298 INFO L93 Difference]: Finished difference Result 896 states and 1394 transitions. [2022-04-28 15:16:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-28 15:16:13,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:13,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:13,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:13,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 891 states have (on average 1.5600448933782267) internal successors, (1390), 891 states have internal predecessors, (1390), 3 states have call successors, (3), 3 states have call 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,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1394 transitions. [2022-04-28 15:16:13,357 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1394 transitions. Word has length 118 [2022-04-28 15:16:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:13,357 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 1394 transitions. [2022-04-28 15:16:13,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 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:16:13,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 896 states and 1394 transitions. [2022-04-28 15:16:14,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1394 edges. 1394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1394 transitions. [2022-04-28 15:16:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-28 15:16:14,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:14,367 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:14,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:16:14,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash -154258084, now seen corresponding path program 1 times [2022-04-28 15:16:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:14,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553401335] [2022-04-28 15:16:29,774 WARN L232 SmtUtils]: Spent 11.06s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:16:38,690 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash -154258084, now seen corresponding path program 2 times [2022-04-28 15:16:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:38,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816520839] [2022-04-28 15:16:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:38,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:38,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {27875#(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); {27868#true} is VALID [2022-04-28 15:16:38,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {27868#true} assume true; {27868#true} is VALID [2022-04-28 15:16:38,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27868#true} {27868#true} #593#return; {27868#true} is VALID [2022-04-28 15:16:38,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {27868#true} call ULTIMATE.init(); {27875#(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:38,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {27875#(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); {27868#true} is VALID [2022-04-28 15:16:38,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {27868#true} assume true; {27868#true} is VALID [2022-04-28 15:16:38,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27868#true} {27868#true} #593#return; {27868#true} is VALID [2022-04-28 15:16:38,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {27868#true} call #t~ret158 := main(); {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {27868#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; {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {27868#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {27868#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {27868#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {27868#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {27868#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-28 15:16:38,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {27868#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {27868#true} assume 12292 == #t~mem49;havoc #t~mem49; {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {27868#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {27868#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {27868#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {27868#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {27868#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {27868#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {27868#true} is VALID [2022-04-28 15:16:38,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {27868#true} assume !(0 == ~tmp___4~0); {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {27868#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {27868#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {27868#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {27868#true} ~skip~0 := 0; {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {27868#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {27868#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {27868#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {27868#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {27868#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {27868#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {27868#true} assume 4368 == #t~mem54;havoc #t~mem54; {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {27868#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {27868#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {27868#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {27868#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {27868#true} is VALID [2022-04-28 15:16:38,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {27868#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {27868#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {27868#true} ~skip~0 := 0; {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {27868#true} assume !false; {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {27868#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {27868#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {27868#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {27868#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {27868#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {27868#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {27868#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {27868#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {27868#true} assume 4384 == #t~mem56;havoc #t~mem56; {27868#true} is VALID [2022-04-28 15:16:38,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {27868#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27868#true} is VALID [2022-04-28 15:16:38,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {27868#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27868#true} is VALID [2022-04-28 15:16:38,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {27868#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {27868#true} is VALID [2022-04-28 15:16:38,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {27868#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {27873#(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); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,954 INFO L290 TraceCheckUtils]: 60: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:16:38,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {27873#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27874#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-28 15:16:38,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {27874#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {27869#false} is VALID [2022-04-28 15:16:38,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {27869#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {27869#false} is VALID [2022-04-28 15:16:38,972 INFO L290 TraceCheckUtils]: 71: Hoare triple {27869#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {27869#false} is VALID [2022-04-28 15:16:38,972 INFO L290 TraceCheckUtils]: 72: Hoare triple {27869#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {27869#false} is VALID [2022-04-28 15:16:38,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {27869#false} assume !(~ret~0 <= 0); {27869#false} is VALID [2022-04-28 15:16:38,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {27869#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {27869#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {27869#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,973 INFO L290 TraceCheckUtils]: 82: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 86: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 87: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 88: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 89: Hoare triple {27869#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {27869#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 91: Hoare triple {27869#false} assume 4416 == #t~mem60;havoc #t~mem60; {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 92: Hoare triple {27869#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 93: Hoare triple {27869#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 94: Hoare triple {27869#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); {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 95: Hoare triple {27869#false} assume !(0 == ~tmp___6~0); {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 96: Hoare triple {27869#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,975 INFO L290 TraceCheckUtils]: 97: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 98: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 99: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 100: Hoare triple {27869#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 101: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 102: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 103: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 104: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 105: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,976 INFO L290 TraceCheckUtils]: 106: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 107: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 109: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 110: Hoare triple {27869#false} assume 4400 == #t~mem58;havoc #t~mem58; {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 111: Hoare triple {27869#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 112: Hoare triple {27869#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 113: Hoare triple {27869#false} assume !(2 == ~blastFlag~0); {27869#false} is VALID [2022-04-28 15:16:38,977 INFO L290 TraceCheckUtils]: 114: Hoare triple {27869#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 115: Hoare triple {27869#false} assume !(~ret~0 <= 0); {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 116: Hoare triple {27869#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 117: Hoare triple {27869#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 118: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 119: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 120: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 121: Hoare triple {27869#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,978 INFO L290 TraceCheckUtils]: 122: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 123: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 124: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 125: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 126: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 127: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 128: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 129: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,979 INFO L290 TraceCheckUtils]: 130: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 131: Hoare triple {27869#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 132: Hoare triple {27869#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 133: Hoare triple {27869#false} assume 4416 == #t~mem60;havoc #t~mem60; {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 134: Hoare triple {27869#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 135: Hoare triple {27869#false} assume !(3 == ~blastFlag~0); {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 136: Hoare triple {27869#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); {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 137: Hoare triple {27869#false} assume !(0 == ~tmp___6~0); {27869#false} is VALID [2022-04-28 15:16:38,980 INFO L290 TraceCheckUtils]: 138: Hoare triple {27869#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 139: Hoare triple {27869#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 140: Hoare triple {27869#false} ~skip~0 := 0; {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 141: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 142: Hoare triple {27869#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 143: Hoare triple {27869#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 144: Hoare triple {27869#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 145: Hoare triple {27869#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 146: Hoare triple {27869#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,981 INFO L290 TraceCheckUtils]: 147: Hoare triple {27869#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 148: Hoare triple {27869#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 149: Hoare triple {27869#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 150: Hoare triple {27869#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 151: Hoare triple {27869#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 152: Hoare triple {27869#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 153: Hoare triple {27869#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 154: Hoare triple {27869#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,982 INFO L290 TraceCheckUtils]: 155: Hoare triple {27869#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27869#false} is VALID [2022-04-28 15:16:38,983 INFO L290 TraceCheckUtils]: 156: Hoare triple {27869#false} assume 4432 == #t~mem62;havoc #t~mem62; {27869#false} is VALID [2022-04-28 15:16:38,983 INFO L290 TraceCheckUtils]: 157: Hoare triple {27869#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {27869#false} is VALID [2022-04-28 15:16:38,983 INFO L290 TraceCheckUtils]: 158: Hoare triple {27869#false} assume 5 == ~blastFlag~0; {27869#false} is VALID [2022-04-28 15:16:38,983 INFO L290 TraceCheckUtils]: 159: Hoare triple {27869#false} assume !false; {27869#false} is VALID [2022-04-28 15:16:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 15:16:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816520839] [2022-04-28 15:16:38,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816520839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:38,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:38,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:38,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553401335] [2022-04-28 15:16:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553401335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:38,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:38,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553081685] [2022-04-28 15:16:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:38,985 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 160 [2022-04-28 15:16:38,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:38,986 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:16:39,057 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:16:39,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:39,058 INFO L87 Difference]: Start difference. First operand 896 states and 1394 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:16:41,080 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:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:42,448 INFO L93 Difference]: Finished difference Result 2294 states and 3524 transitions. [2022-04-28 15:16:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:42,449 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 160 [2022-04-28 15:16:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:42,449 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:16:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:16:42,451 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:16:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:16:42,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 15:16:42,785 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:16:42,866 INFO L225 Difference]: With dead ends: 2294 [2022-04-28 15:16:42,866 INFO L226 Difference]: Without dead ends: 1414 [2022-04-28 15:16:42,867 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:16:42,868 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 111 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:42,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:16:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2022-04-28 15:16:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1001. [2022-04-28 15:16:42,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:42,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1414 states. Second operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call 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:42,937 INFO L74 IsIncluded]: Start isIncluded. First operand 1414 states. Second operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call 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:42,939 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call 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:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,008 INFO L93 Difference]: Finished difference Result 1414 states and 2139 transitions. [2022-04-28 15:16:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2139 transitions. [2022-04-28 15:16:43,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:43,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:43,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 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 1414 states. [2022-04-28 15:16:43,014 INFO L87 Difference]: Start difference. First operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 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 1414 states. [2022-04-28 15:16:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,096 INFO L93 Difference]: Finished difference Result 1414 states and 2139 transitions. [2022-04-28 15:16:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2139 transitions. [2022-04-28 15:16:43,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:43,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:43,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:43,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 996 states have (on average 1.5652610441767068) internal successors, (1559), 996 states have internal predecessors, (1559), 3 states have call successors, (3), 3 states have call 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:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1563 transitions. [2022-04-28 15:16:43,167 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1563 transitions. Word has length 160 [2022-04-28 15:16:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:43,169 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1563 transitions. [2022-04-28 15:16:43,169 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:16:43,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1001 states and 1563 transitions. [2022-04-28 15:16:44,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1563 edges. 1563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1563 transitions. [2022-04-28 15:16:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-28 15:16:44,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:44,418 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2022-04-28 15:16:44,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:16:44,418 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1057182855, now seen corresponding path program 1 times [2022-04-28 15:16:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:44,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106018782] [2022-04-28 15:17:04,312 WARN L232 SmtUtils]: Spent 15.78s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:17:12,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1057182855, now seen corresponding path program 2 times [2022-04-28 15:17:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:12,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836761856] [2022-04-28 15:17:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:12,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {37305#(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); {37298#true} is VALID [2022-04-28 15:17:12,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {37298#true} assume true; {37298#true} is VALID [2022-04-28 15:17:12,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37298#true} {37298#true} #593#return; {37298#true} is VALID [2022-04-28 15:17:12,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {37298#true} call ULTIMATE.init(); {37305#(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:12,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {37305#(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); {37298#true} is VALID [2022-04-28 15:17:12,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {37298#true} assume true; {37298#true} is VALID [2022-04-28 15:17:12,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37298#true} {37298#true} #593#return; {37298#true} is VALID [2022-04-28 15:17:12,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {37298#true} call #t~ret158 := main(); {37298#true} is VALID [2022-04-28 15:17:12,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {37298#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; {37298#true} is VALID [2022-04-28 15:17:12,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {37298#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {37298#true} is VALID [2022-04-28 15:17:12,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {37298#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {37298#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {37298#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {37298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {37298#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {37298#true} assume 12292 == #t~mem49;havoc #t~mem49; {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {37298#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {37298#true} is VALID [2022-04-28 15:17:12,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {37298#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {37298#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {37298#true} is VALID [2022-04-28 15:17:12,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {37298#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {37298#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {37298#true} is VALID [2022-04-28 15:17:12,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {37298#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {37298#true} is VALID [2022-04-28 15:17:12,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {37298#true} assume !(0 == ~tmp___4~0); {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {37298#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {37298#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {37298#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {37298#true} assume 4368 == #t~mem54;havoc #t~mem54; {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {37298#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {37298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37298#true} is VALID [2022-04-28 15:17:12,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {37298#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {37298#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {37298#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {37298#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {37298#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {37298#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {37298#true} assume 4384 == #t~mem56;havoc #t~mem56; {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {37298#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37298#true} is VALID [2022-04-28 15:17:12,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {37298#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {37298#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {37298#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {37298#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {37298#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 57: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-28 15:17:12,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 59: Hoare triple {37298#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 60: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 62: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {37298#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {37298#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {37298#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {37298#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {37298#true} assume 4400 == #t~mem58;havoc #t~mem58; {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {37298#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {37298#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {37298#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {37298#true} assume !(~ret~0 <= 0); {37298#true} is VALID [2022-04-28 15:17:12,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {37298#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {37298#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {37298#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {37298#true} ~skip~0 := 0; {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 78: Hoare triple {37298#true} assume !false; {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 79: Hoare triple {37298#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 80: Hoare triple {37298#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 81: Hoare triple {37298#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,990 INFO L290 TraceCheckUtils]: 82: Hoare triple {37298#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 83: Hoare triple {37298#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 84: Hoare triple {37298#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 85: Hoare triple {37298#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {37298#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 87: Hoare triple {37298#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 88: Hoare triple {37298#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 89: Hoare triple {37298#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,991 INFO L290 TraceCheckUtils]: 90: Hoare triple {37298#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37298#true} is VALID [2022-04-28 15:17:12,992 INFO L290 TraceCheckUtils]: 91: Hoare triple {37298#true} assume 4416 == #t~mem60;havoc #t~mem60; {37298#true} is VALID [2022-04-28 15:17:12,992 INFO L290 TraceCheckUtils]: 92: Hoare triple {37298#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37298#true} is VALID [2022-04-28 15:17:12,992 INFO L290 TraceCheckUtils]: 93: Hoare triple {37298#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {37298#true} is VALID [2022-04-28 15:17:12,993 INFO L290 TraceCheckUtils]: 94: Hoare triple {37298#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); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,994 INFO L290 TraceCheckUtils]: 95: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,994 INFO L290 TraceCheckUtils]: 96: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,994 INFO L290 TraceCheckUtils]: 97: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,995 INFO L290 TraceCheckUtils]: 98: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,995 INFO L290 TraceCheckUtils]: 99: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,997 INFO L290 TraceCheckUtils]: 102: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,998 INFO L290 TraceCheckUtils]: 105: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,998 INFO L290 TraceCheckUtils]: 106: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,999 INFO L290 TraceCheckUtils]: 107: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:12,999 INFO L290 TraceCheckUtils]: 108: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:13,000 INFO L290 TraceCheckUtils]: 109: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:17:13,000 INFO L290 TraceCheckUtils]: 110: Hoare triple {37303#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37304#(not (= |ssl3_connect_#t~mem59| 4401))} is VALID [2022-04-28 15:17:13,000 INFO L290 TraceCheckUtils]: 111: Hoare triple {37304#(not (= |ssl3_connect_#t~mem59| 4401))} assume 4401 == #t~mem59;havoc #t~mem59; {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 112: Hoare triple {37299#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 113: Hoare triple {37299#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 114: Hoare triple {37299#false} assume !(2 == ~blastFlag~0); {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 115: Hoare triple {37299#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 116: Hoare triple {37299#false} assume !(~ret~0 <= 0); {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 117: Hoare triple {37299#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 118: Hoare triple {37299#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,001 INFO L290 TraceCheckUtils]: 119: Hoare triple {37299#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 120: Hoare triple {37299#false} ~skip~0 := 0; {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 121: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 122: Hoare triple {37299#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 123: Hoare triple {37299#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {37299#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {37299#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {37299#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {37299#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 128: Hoare triple {37299#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 129: Hoare triple {37299#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 130: Hoare triple {37299#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 131: Hoare triple {37299#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 132: Hoare triple {37299#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 133: Hoare triple {37299#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 134: Hoare triple {37299#false} assume 4416 == #t~mem60;havoc #t~mem60; {37299#false} is VALID [2022-04-28 15:17:13,003 INFO L290 TraceCheckUtils]: 135: Hoare triple {37299#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 136: Hoare triple {37299#false} assume !(3 == ~blastFlag~0); {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 137: Hoare triple {37299#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); {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 138: Hoare triple {37299#false} assume !(0 == ~tmp___6~0); {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 139: Hoare triple {37299#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 140: Hoare triple {37299#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 141: Hoare triple {37299#false} ~skip~0 := 0; {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 142: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-28 15:17:13,004 INFO L290 TraceCheckUtils]: 143: Hoare triple {37299#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 144: Hoare triple {37299#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 145: Hoare triple {37299#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 146: Hoare triple {37299#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 147: Hoare triple {37299#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 148: Hoare triple {37299#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 149: Hoare triple {37299#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 150: Hoare triple {37299#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,005 INFO L290 TraceCheckUtils]: 151: Hoare triple {37299#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 152: Hoare triple {37299#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 153: Hoare triple {37299#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 154: Hoare triple {37299#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 155: Hoare triple {37299#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 156: Hoare triple {37299#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 157: Hoare triple {37299#false} assume 4432 == #t~mem62;havoc #t~mem62; {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 158: Hoare triple {37299#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {37299#false} is VALID [2022-04-28 15:17:13,006 INFO L290 TraceCheckUtils]: 159: Hoare triple {37299#false} assume 5 == ~blastFlag~0; {37299#false} is VALID [2022-04-28 15:17:13,007 INFO L290 TraceCheckUtils]: 160: Hoare triple {37299#false} assume !false; {37299#false} is VALID [2022-04-28 15:17:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 15:17:13,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836761856] [2022-04-28 15:17:13,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836761856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:13,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:13,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:13,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106018782] [2022-04-28 15:17:13,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106018782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:13,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:13,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097216391] [2022-04-28 15:17:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 161 [2022-04-28 15:17:13,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:13,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call 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:13,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:13,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:13,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:13,100 INFO L87 Difference]: Start difference. First operand 1001 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call 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:15,126 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:17:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:16,360 INFO L93 Difference]: Finished difference Result 2368 states and 3635 transitions. [2022-04-28 15:17:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:16,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 161 [2022-04-28 15:17:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call 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:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 15:17:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call 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:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-28 15:17:16,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-28 15:17:16,683 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:16,756 INFO L225 Difference]: With dead ends: 2368 [2022-04-28 15:17:16,756 INFO L226 Difference]: Without dead ends: 1383 [2022-04-28 15:17:16,758 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:16,758 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:16,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-04-28 15:17:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1001. [2022-04-28 15:17:16,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:16,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1383 states. Second operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call 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:16,813 INFO L74 IsIncluded]: Start isIncluded. First operand 1383 states. Second operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call 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:16,814 INFO L87 Difference]: Start difference. First operand 1383 states. Second operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call 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:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:16,891 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2022-04-28 15:17:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2022-04-28 15:17:16,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:16,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:16,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 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 1383 states. [2022-04-28 15:17:16,904 INFO L87 Difference]: Start difference. First operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 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 1383 states. [2022-04-28 15:17:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:16,992 INFO L93 Difference]: Finished difference Result 1383 states and 2081 transitions. [2022-04-28 15:17:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2022-04-28 15:17:16,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:16,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:16,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:16,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 996 states have (on average 1.5542168674698795) internal successors, (1548), 996 states have internal predecessors, (1548), 3 states have call successors, (3), 3 states have call 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:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1552 transitions. [2022-04-28 15:17:17,038 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1552 transitions. Word has length 161 [2022-04-28 15:17:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:17,038 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1552 transitions. [2022-04-28 15:17:17,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call 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:17,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1001 states and 1552 transitions. [2022-04-28 15:17:18,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1552 edges. 1552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1552 transitions. [2022-04-28 15:17:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-28 15:17:18,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:18,262 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:18,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:17:18,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1464555500, now seen corresponding path program 1 times [2022-04-28 15:17:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:18,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788822163] [2022-04-28 15:17:35,312 WARN L232 SmtUtils]: Spent 12.76s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:17:44,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1464555500, now seen corresponding path program 2 times [2022-04-28 15:17:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714413652] [2022-04-28 15:17:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:44,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:44,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {46821#(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); {46814#true} is VALID [2022-04-28 15:17:44,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {46814#true} assume true; {46814#true} is VALID [2022-04-28 15:17:44,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46814#true} {46814#true} #593#return; {46814#true} is VALID [2022-04-28 15:17:44,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {46814#true} call ULTIMATE.init(); {46821#(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:44,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {46821#(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); {46814#true} is VALID [2022-04-28 15:17:44,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {46814#true} assume true; {46814#true} is VALID [2022-04-28 15:17:44,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46814#true} {46814#true} #593#return; {46814#true} is VALID [2022-04-28 15:17:44,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {46814#true} call #t~ret158 := main(); {46814#true} is VALID [2022-04-28 15:17:44,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {46814#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; {46814#true} is VALID [2022-04-28 15:17:44,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {46814#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {46814#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {46814#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {46814#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {46814#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {46814#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {46814#true} assume 12292 == #t~mem49;havoc #t~mem49; {46814#true} is VALID [2022-04-28 15:17:44,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {46814#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {46814#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {46814#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {46814#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {46814#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {46814#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {46814#true} assume !(0 == ~tmp___4~0); {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {46814#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {46814#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {46814#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {46814#true} assume 4368 == #t~mem54;havoc #t~mem54; {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {46814#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {46814#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {46814#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {46814#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {46814#true} is VALID [2022-04-28 15:17:44,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {46814#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {46814#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {46814#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {46814#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {46814#true} assume 4384 == #t~mem56;havoc #t~mem56; {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {46814#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {46814#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {46814#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {46814#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {46814#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {46814#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {46814#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {46814#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {46814#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {46814#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {46814#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {46814#true} assume 4400 == #t~mem58;havoc #t~mem58; {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {46814#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {46814#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {46814#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {46814#true} assume !(~ret~0 <= 0); {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {46814#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {46814#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,552 INFO L290 TraceCheckUtils]: 76: Hoare triple {46814#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {46814#true} ~skip~0 := 0; {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {46814#true} assume !false; {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 79: Hoare triple {46814#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 80: Hoare triple {46814#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 81: Hoare triple {46814#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 82: Hoare triple {46814#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 83: Hoare triple {46814#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,553 INFO L290 TraceCheckUtils]: 84: Hoare triple {46814#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 85: Hoare triple {46814#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 86: Hoare triple {46814#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 87: Hoare triple {46814#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 88: Hoare triple {46814#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 89: Hoare triple {46814#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 90: Hoare triple {46814#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 91: Hoare triple {46814#true} assume 4416 == #t~mem60;havoc #t~mem60; {46814#true} is VALID [2022-04-28 15:17:44,554 INFO L290 TraceCheckUtils]: 92: Hoare triple {46814#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {46814#true} is VALID [2022-04-28 15:17:44,555 INFO L290 TraceCheckUtils]: 93: Hoare triple {46814#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {46814#true} is VALID [2022-04-28 15:17:44,556 INFO L290 TraceCheckUtils]: 94: Hoare triple {46814#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); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,556 INFO L290 TraceCheckUtils]: 95: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == ~tmp___6~0); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,557 INFO L290 TraceCheckUtils]: 96: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,557 INFO L290 TraceCheckUtils]: 97: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,557 INFO L290 TraceCheckUtils]: 98: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} ~skip~0 := 0; {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,558 INFO L290 TraceCheckUtils]: 99: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !false; {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,558 INFO L290 TraceCheckUtils]: 100: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,558 INFO L290 TraceCheckUtils]: 101: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,559 INFO L290 TraceCheckUtils]: 104: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,560 INFO L290 TraceCheckUtils]: 105: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,560 INFO L290 TraceCheckUtils]: 106: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} is VALID [2022-04-28 15:17:44,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {46819#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4384))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46820#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-28 15:17:44,561 INFO L290 TraceCheckUtils]: 108: Hoare triple {46820#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {46815#false} is VALID [2022-04-28 15:17:44,561 INFO L290 TraceCheckUtils]: 109: Hoare triple {46815#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {46815#false} is VALID [2022-04-28 15:17:44,561 INFO L290 TraceCheckUtils]: 110: Hoare triple {46815#false} assume !(1 == ~blastFlag~0); {46815#false} is VALID [2022-04-28 15:17:44,561 INFO L290 TraceCheckUtils]: 111: Hoare triple {46815#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,561 INFO L290 TraceCheckUtils]: 112: Hoare triple {46815#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,561 INFO L290 TraceCheckUtils]: 113: Hoare triple {46815#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 114: Hoare triple {46815#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 115: Hoare triple {46815#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 116: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 117: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 118: Hoare triple {46815#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 119: Hoare triple {46815#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,562 INFO L290 TraceCheckUtils]: 120: Hoare triple {46815#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 121: Hoare triple {46815#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 122: Hoare triple {46815#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 123: Hoare triple {46815#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 124: Hoare triple {46815#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 125: Hoare triple {46815#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 126: Hoare triple {46815#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 127: Hoare triple {46815#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,563 INFO L290 TraceCheckUtils]: 128: Hoare triple {46815#false} assume 4400 == #t~mem58;havoc #t~mem58; {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 129: Hoare triple {46815#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 130: Hoare triple {46815#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 131: Hoare triple {46815#false} assume !(2 == ~blastFlag~0); {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 132: Hoare triple {46815#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 133: Hoare triple {46815#false} assume !(~ret~0 <= 0); {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 134: Hoare triple {46815#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 135: Hoare triple {46815#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,564 INFO L290 TraceCheckUtils]: 136: Hoare triple {46815#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 137: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 138: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 139: Hoare triple {46815#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 140: Hoare triple {46815#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 141: Hoare triple {46815#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 142: Hoare triple {46815#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,565 INFO L290 TraceCheckUtils]: 143: Hoare triple {46815#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 144: Hoare triple {46815#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 145: Hoare triple {46815#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 146: Hoare triple {46815#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 147: Hoare triple {46815#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 148: Hoare triple {46815#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 149: Hoare triple {46815#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 150: Hoare triple {46815#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,566 INFO L290 TraceCheckUtils]: 151: Hoare triple {46815#false} assume 4416 == #t~mem60;havoc #t~mem60; {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 152: Hoare triple {46815#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 153: Hoare triple {46815#false} assume !(3 == ~blastFlag~0); {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 154: Hoare triple {46815#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); {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 155: Hoare triple {46815#false} assume !(0 == ~tmp___6~0); {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 156: Hoare triple {46815#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 157: Hoare triple {46815#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 158: Hoare triple {46815#false} ~skip~0 := 0; {46815#false} is VALID [2022-04-28 15:17:44,567 INFO L290 TraceCheckUtils]: 159: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 160: Hoare triple {46815#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 161: Hoare triple {46815#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 162: Hoare triple {46815#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 163: Hoare triple {46815#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 164: Hoare triple {46815#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 165: Hoare triple {46815#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 166: Hoare triple {46815#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,568 INFO L290 TraceCheckUtils]: 167: Hoare triple {46815#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 168: Hoare triple {46815#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 169: Hoare triple {46815#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 170: Hoare triple {46815#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 171: Hoare triple {46815#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 172: Hoare triple {46815#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 173: Hoare triple {46815#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 174: Hoare triple {46815#false} assume 4432 == #t~mem62;havoc #t~mem62; {46815#false} is VALID [2022-04-28 15:17:44,569 INFO L290 TraceCheckUtils]: 175: Hoare triple {46815#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {46815#false} is VALID [2022-04-28 15:17:44,570 INFO L290 TraceCheckUtils]: 176: Hoare triple {46815#false} assume 5 == ~blastFlag~0; {46815#false} is VALID [2022-04-28 15:17:44,570 INFO L290 TraceCheckUtils]: 177: Hoare triple {46815#false} assume !false; {46815#false} is VALID [2022-04-28 15:17:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-28 15:17:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714413652] [2022-04-28 15:17:44,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714413652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:44,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:44,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:44,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788822163] [2022-04-28 15:17:44,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788822163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:44,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:44,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720388176] [2022-04-28 15:17:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:44,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 178 [2022-04-28 15:17:44,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:44,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:44,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:44,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:44,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:44,660 INFO L87 Difference]: Start difference. First operand 1001 states and 1552 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:46,690 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:17:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,897 INFO L93 Difference]: Finished difference Result 2493 states and 3818 transitions. [2022-04-28 15:17:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 178 [2022-04-28 15:17:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 15:17:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 15:17:47,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 15:17:48,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:48,318 INFO L225 Difference]: With dead ends: 2493 [2022-04-28 15:17:48,318 INFO L226 Difference]: Without dead ends: 1508 [2022-04-28 15:17:48,320 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:48,321 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:17:48,321 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:17:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-28 15:17:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1091. [2022-04-28 15:17:48,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:48,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call 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:48,390 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call 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:48,391 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call 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:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:48,462 INFO L93 Difference]: Finished difference Result 1508 states and 2270 transitions. [2022-04-28 15:17:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2270 transitions. [2022-04-28 15:17:48,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:48,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:48,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 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 1508 states. [2022-04-28 15:17:48,465 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 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 1508 states. [2022-04-28 15:17:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:48,522 INFO L93 Difference]: Finished difference Result 1508 states and 2270 transitions. [2022-04-28 15:17:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2270 transitions. [2022-04-28 15:17:48,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:48,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:48,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:48,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5534069981583793) internal successors, (1687), 1086 states have internal predecessors, (1687), 3 states have call successors, (3), 3 states have call 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:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1691 transitions. [2022-04-28 15:17:48,583 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1691 transitions. Word has length 178 [2022-04-28 15:17:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:48,584 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1691 transitions. [2022-04-28 15:17:48,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:48,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1691 transitions. [2022-04-28 15:17:49,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1691 edges. 1691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1691 transitions. [2022-04-28 15:17:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-28 15:17:49,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:49,973 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 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] [2022-04-28 15:17:49,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:17:49,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1065449955, now seen corresponding path program 1 times [2022-04-28 15:17:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:49,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [746274449] [2022-04-28 15:18:01,735 WARN L232 SmtUtils]: Spent 7.27s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:18:09,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1065449955, now seen corresponding path program 2 times [2022-04-28 15:18:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:09,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405949594] [2022-04-28 15:18:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:09,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:09,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {57017#(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); {57010#true} is VALID [2022-04-28 15:18:09,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {57010#true} assume true; {57010#true} is VALID [2022-04-28 15:18:09,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57010#true} {57010#true} #593#return; {57010#true} is VALID [2022-04-28 15:18:09,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {57010#true} call ULTIMATE.init(); {57017#(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:09,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {57017#(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); {57010#true} is VALID [2022-04-28 15:18:09,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {57010#true} assume true; {57010#true} is VALID [2022-04-28 15:18:09,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57010#true} {57010#true} #593#return; {57010#true} is VALID [2022-04-28 15:18:09,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {57010#true} call #t~ret158 := main(); {57010#true} is VALID [2022-04-28 15:18:09,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {57010#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; {57010#true} is VALID [2022-04-28 15:18:09,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {57010#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {57010#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {57010#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {57010#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {57010#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {57010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {57010#true} assume 12292 == #t~mem49;havoc #t~mem49; {57010#true} is VALID [2022-04-28 15:18:09,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {57010#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {57010#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {57010#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {57010#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {57010#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {57010#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {57010#true} assume !(0 == ~tmp___4~0); {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {57010#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {57010#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {57010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {57010#true} assume 4368 == #t~mem54;havoc #t~mem54; {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {57010#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {57010#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {57010#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {57010#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {57010#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {57010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {57010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {57010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {57010#true} assume 4384 == #t~mem56;havoc #t~mem56; {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {57010#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {57010#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {57010#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {57010#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {57010#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {57010#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 59: Hoare triple {57010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {57010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {57010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {57010#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {57010#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {57010#true} assume 4400 == #t~mem58;havoc #t~mem58; {57010#true} is VALID [2022-04-28 15:18:09,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {57010#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {57010#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 72: Hoare triple {57010#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {57010#true} assume !(~ret~0 <= 0); {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {57010#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {57010#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {57010#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {57010#true} ~skip~0 := 0; {57010#true} is VALID [2022-04-28 15:18:09,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {57010#true} assume !false; {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 79: Hoare triple {57010#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 80: Hoare triple {57010#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {57010#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {57010#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 83: Hoare triple {57010#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 84: Hoare triple {57010#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 85: Hoare triple {57010#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {57010#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 87: Hoare triple {57010#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 88: Hoare triple {57010#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {57010#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {57010#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 91: Hoare triple {57010#true} assume 4416 == #t~mem60;havoc #t~mem60; {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {57010#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {57010#true} is VALID [2022-04-28 15:18:09,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {57010#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57010#true} is VALID [2022-04-28 15:18:09,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {57010#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); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,324 INFO L290 TraceCheckUtils]: 95: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,325 INFO L290 TraceCheckUtils]: 98: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,327 INFO L290 TraceCheckUtils]: 101: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,327 INFO L290 TraceCheckUtils]: 102: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,328 INFO L290 TraceCheckUtils]: 103: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,328 INFO L290 TraceCheckUtils]: 105: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,329 INFO L290 TraceCheckUtils]: 106: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,329 INFO L290 TraceCheckUtils]: 107: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:09,330 INFO L290 TraceCheckUtils]: 108: Hoare triple {57015#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57016#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-28 15:18:09,330 INFO L290 TraceCheckUtils]: 109: Hoare triple {57016#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {57011#false} is VALID [2022-04-28 15:18:09,330 INFO L290 TraceCheckUtils]: 110: Hoare triple {57011#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {57011#false} is VALID [2022-04-28 15:18:09,330 INFO L290 TraceCheckUtils]: 111: Hoare triple {57011#false} assume !(1 == ~blastFlag~0); {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 112: Hoare triple {57011#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 113: Hoare triple {57011#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 114: Hoare triple {57011#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 115: Hoare triple {57011#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 116: Hoare triple {57011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 117: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 118: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-28 15:18:09,331 INFO L290 TraceCheckUtils]: 119: Hoare triple {57011#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 120: Hoare triple {57011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 121: Hoare triple {57011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 122: Hoare triple {57011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 123: Hoare triple {57011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 124: Hoare triple {57011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 125: Hoare triple {57011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 126: Hoare triple {57011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,332 INFO L290 TraceCheckUtils]: 127: Hoare triple {57011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 128: Hoare triple {57011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 129: Hoare triple {57011#false} assume 4400 == #t~mem58;havoc #t~mem58; {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 130: Hoare triple {57011#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 131: Hoare triple {57011#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 132: Hoare triple {57011#false} assume !(2 == ~blastFlag~0); {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 133: Hoare triple {57011#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 134: Hoare triple {57011#false} assume !(~ret~0 <= 0); {57011#false} is VALID [2022-04-28 15:18:09,333 INFO L290 TraceCheckUtils]: 135: Hoare triple {57011#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 136: Hoare triple {57011#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 137: Hoare triple {57011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 138: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 139: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 140: Hoare triple {57011#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 141: Hoare triple {57011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 142: Hoare triple {57011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 143: Hoare triple {57011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,334 INFO L290 TraceCheckUtils]: 144: Hoare triple {57011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 145: Hoare triple {57011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 146: Hoare triple {57011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 147: Hoare triple {57011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 148: Hoare triple {57011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 149: Hoare triple {57011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 150: Hoare triple {57011#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 151: Hoare triple {57011#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,335 INFO L290 TraceCheckUtils]: 152: Hoare triple {57011#false} assume 4416 == #t~mem60;havoc #t~mem60; {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 153: Hoare triple {57011#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 154: Hoare triple {57011#false} assume !(3 == ~blastFlag~0); {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 155: Hoare triple {57011#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); {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 156: Hoare triple {57011#false} assume !(0 == ~tmp___6~0); {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 157: Hoare triple {57011#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 158: Hoare triple {57011#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 159: Hoare triple {57011#false} ~skip~0 := 0; {57011#false} is VALID [2022-04-28 15:18:09,336 INFO L290 TraceCheckUtils]: 160: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 161: Hoare triple {57011#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 162: Hoare triple {57011#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 163: Hoare triple {57011#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 164: Hoare triple {57011#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 165: Hoare triple {57011#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 166: Hoare triple {57011#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 167: Hoare triple {57011#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,337 INFO L290 TraceCheckUtils]: 168: Hoare triple {57011#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 169: Hoare triple {57011#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 170: Hoare triple {57011#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 171: Hoare triple {57011#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 172: Hoare triple {57011#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 173: Hoare triple {57011#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 174: Hoare triple {57011#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 175: Hoare triple {57011#false} assume 4432 == #t~mem62;havoc #t~mem62; {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 176: Hoare triple {57011#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {57011#false} is VALID [2022-04-28 15:18:09,338 INFO L290 TraceCheckUtils]: 177: Hoare triple {57011#false} assume 5 == ~blastFlag~0; {57011#false} is VALID [2022-04-28 15:18:09,339 INFO L290 TraceCheckUtils]: 178: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2022-04-28 15:18:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-28 15:18:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:09,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405949594] [2022-04-28 15:18:09,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405949594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:09,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:09,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:09,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:09,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [746274449] [2022-04-28 15:18:09,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [746274449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:09,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:09,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648940187] [2022-04-28 15:18:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:09,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 179 [2022-04-28 15:18:09,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:09,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call 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:09,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:09,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:09,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:09,441 INFO L87 Difference]: Start difference. First operand 1091 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call 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:11,467 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:18:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:13,036 INFO L93 Difference]: Finished difference Result 2452 states and 3760 transitions. [2022-04-28 15:18:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:13,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 179 [2022-04-28 15:18:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call 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:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:18:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call 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:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:18:13,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-28 15:18:13,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:13,415 INFO L225 Difference]: With dead ends: 2452 [2022-04-28 15:18:13,415 INFO L226 Difference]: Without dead ends: 1377 [2022-04-28 15:18:13,417 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:13,417 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 86 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:13,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 541 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-04-28 15:18:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1091. [2022-04-28 15:18:13,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:13,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1377 states. Second operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call 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:13,497 INFO L74 IsIncluded]: Start isIncluded. First operand 1377 states. Second operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call 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:13,499 INFO L87 Difference]: Start difference. First operand 1377 states. Second operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call 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:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:13,570 INFO L93 Difference]: Finished difference Result 1377 states and 2084 transitions. [2022-04-28 15:18:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2084 transitions. [2022-04-28 15:18:13,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:13,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:13,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 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 1377 states. [2022-04-28 15:18:13,573 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 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 1377 states. [2022-04-28 15:18:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:13,628 INFO L93 Difference]: Finished difference Result 1377 states and 2084 transitions. [2022-04-28 15:18:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2084 transitions. [2022-04-28 15:18:13,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:13,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:13,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:13,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5488029465930018) internal successors, (1682), 1086 states have internal predecessors, (1682), 3 states have call successors, (3), 3 states have call 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:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1686 transitions. [2022-04-28 15:18:13,678 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1686 transitions. Word has length 179 [2022-04-28 15:18:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:13,678 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1686 transitions. [2022-04-28 15:18:13,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call 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:13,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1686 transitions. [2022-04-28 15:18:15,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1686 edges. 1686 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1686 transitions. [2022-04-28 15:18:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-28 15:18:15,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:15,104 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:15,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:18:15,104 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash 624136773, now seen corresponding path program 3 times [2022-04-28 15:18:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:15,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229448714] [2022-04-28 15:18:24,437 WARN L232 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:18:31,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash 624136773, now seen corresponding path program 4 times [2022-04-28 15:18:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:31,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421935278] [2022-04-28 15:18:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:32,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {66869#(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); {66862#true} is VALID [2022-04-28 15:18:32,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {66862#true} assume true; {66862#true} is VALID [2022-04-28 15:18:32,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66862#true} {66862#true} #593#return; {66862#true} is VALID [2022-04-28 15:18:32,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {66862#true} call ULTIMATE.init(); {66869#(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:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {66869#(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); {66862#true} is VALID [2022-04-28 15:18:32,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {66862#true} assume true; {66862#true} is VALID [2022-04-28 15:18:32,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66862#true} {66862#true} #593#return; {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {66862#true} call #t~ret158 := main(); {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {66862#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; {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {66862#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {66862#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {66862#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {66862#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {66862#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66862#true} is VALID [2022-04-28 15:18:32,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {66862#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {66862#true} assume 12292 == #t~mem49;havoc #t~mem49; {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {66862#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {66862#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {66862#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {66862#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {66862#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {66862#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {66862#true} assume !(0 == ~tmp___4~0); {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {66862#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {66862#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-28 15:18:32,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {66862#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {66862#true} assume 4368 == #t~mem54;havoc #t~mem54; {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {66862#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {66862#true} is VALID [2022-04-28 15:18:32,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {66862#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {66862#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {66862#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {66862#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-28 15:18:32,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {66862#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {66862#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {66862#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {66862#true} assume 4384 == #t~mem56;havoc #t~mem56; {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {66862#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {66862#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {66862#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {66862#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {66862#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {66862#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-28 15:18:32,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {66862#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {66862#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {66862#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {66862#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {66862#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {66862#true} assume 4400 == #t~mem58;havoc #t~mem58; {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {66862#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 71: Hoare triple {66862#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {66862#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {66862#true} is VALID [2022-04-28 15:18:32,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {66862#true} assume !(~ret~0 <= 0); {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 74: Hoare triple {66862#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 75: Hoare triple {66862#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 76: Hoare triple {66862#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 77: Hoare triple {66862#true} ~skip~0 := 0; {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 78: Hoare triple {66862#true} assume !false; {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 79: Hoare triple {66862#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 80: Hoare triple {66862#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,285 INFO L290 TraceCheckUtils]: 81: Hoare triple {66862#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 82: Hoare triple {66862#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 83: Hoare triple {66862#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 84: Hoare triple {66862#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 85: Hoare triple {66862#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 86: Hoare triple {66862#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 87: Hoare triple {66862#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 88: Hoare triple {66862#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,286 INFO L290 TraceCheckUtils]: 89: Hoare triple {66862#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,288 INFO L290 TraceCheckUtils]: 90: Hoare triple {66862#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66862#true} is VALID [2022-04-28 15:18:32,288 INFO L290 TraceCheckUtils]: 91: Hoare triple {66862#true} assume 4416 == #t~mem60;havoc #t~mem60; {66862#true} is VALID [2022-04-28 15:18:32,288 INFO L290 TraceCheckUtils]: 92: Hoare triple {66862#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {66862#true} is VALID [2022-04-28 15:18:32,288 INFO L290 TraceCheckUtils]: 93: Hoare triple {66862#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {66862#true} is VALID [2022-04-28 15:18:32,300 INFO L290 TraceCheckUtils]: 94: Hoare triple {66862#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); {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:18:32,300 INFO L290 TraceCheckUtils]: 95: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:18:32,301 INFO L290 TraceCheckUtils]: 96: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:18:32,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:18:32,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:18:32,302 INFO L290 TraceCheckUtils]: 99: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:18:32,302 INFO L290 TraceCheckUtils]: 100: Hoare triple {66867#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66868#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-28 15:18:32,302 INFO L290 TraceCheckUtils]: 101: Hoare triple {66868#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 102: Hoare triple {66863#false} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 103: Hoare triple {66863#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 104: Hoare triple {66863#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 105: Hoare triple {66863#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 106: Hoare triple {66863#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 107: Hoare triple {66863#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 108: Hoare triple {66863#false} assume !(0 == ~tmp___4~0); {66863#false} is VALID [2022-04-28 15:18:32,303 INFO L290 TraceCheckUtils]: 109: Hoare triple {66863#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 110: Hoare triple {66863#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 111: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 112: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 113: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 114: Hoare triple {66863#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 115: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,304 INFO L290 TraceCheckUtils]: 116: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 117: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 118: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 119: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 120: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 121: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 122: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 123: Hoare triple {66863#false} assume 4385 == #t~mem57;havoc #t~mem57; {66863#false} is VALID [2022-04-28 15:18:32,305 INFO L290 TraceCheckUtils]: 124: Hoare triple {66863#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 125: Hoare triple {66863#false} assume !(1 == ~blastFlag~0); {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 126: Hoare triple {66863#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 127: Hoare triple {66863#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 128: Hoare triple {66863#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 129: Hoare triple {66863#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 130: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 131: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-28 15:18:32,306 INFO L290 TraceCheckUtils]: 132: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {66863#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 134: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 135: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 136: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 137: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 138: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 139: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,307 INFO L290 TraceCheckUtils]: 140: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 141: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 142: Hoare triple {66863#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 143: Hoare triple {66863#false} assume 4400 == #t~mem58;havoc #t~mem58; {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 144: Hoare triple {66863#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 145: Hoare triple {66863#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 146: Hoare triple {66863#false} assume !(2 == ~blastFlag~0); {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 147: Hoare triple {66863#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {66863#false} is VALID [2022-04-28 15:18:32,308 INFO L290 TraceCheckUtils]: 148: Hoare triple {66863#false} assume !(~ret~0 <= 0); {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {66863#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {66863#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 151: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 152: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 153: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 154: Hoare triple {66863#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 155: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,309 INFO L290 TraceCheckUtils]: 156: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 157: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 158: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 159: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 160: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 161: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 162: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 163: Hoare triple {66863#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,310 INFO L290 TraceCheckUtils]: 164: Hoare triple {66863#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 165: Hoare triple {66863#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 166: Hoare triple {66863#false} assume 4416 == #t~mem60;havoc #t~mem60; {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 167: Hoare triple {66863#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 168: Hoare triple {66863#false} assume !(3 == ~blastFlag~0); {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 169: Hoare triple {66863#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); {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 170: Hoare triple {66863#false} assume !(0 == ~tmp___6~0); {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 171: Hoare triple {66863#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,311 INFO L290 TraceCheckUtils]: 172: Hoare triple {66863#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 173: Hoare triple {66863#false} ~skip~0 := 0; {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 174: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 175: Hoare triple {66863#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 176: Hoare triple {66863#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 177: Hoare triple {66863#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 178: Hoare triple {66863#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 179: Hoare triple {66863#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,312 INFO L290 TraceCheckUtils]: 180: Hoare triple {66863#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 181: Hoare triple {66863#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 182: Hoare triple {66863#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 183: Hoare triple {66863#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 184: Hoare triple {66863#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 185: Hoare triple {66863#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 186: Hoare triple {66863#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 187: Hoare triple {66863#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,313 INFO L290 TraceCheckUtils]: 188: Hoare triple {66863#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66863#false} is VALID [2022-04-28 15:18:32,314 INFO L290 TraceCheckUtils]: 189: Hoare triple {66863#false} assume 4432 == #t~mem62;havoc #t~mem62; {66863#false} is VALID [2022-04-28 15:18:32,314 INFO L290 TraceCheckUtils]: 190: Hoare triple {66863#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {66863#false} is VALID [2022-04-28 15:18:32,314 INFO L290 TraceCheckUtils]: 191: Hoare triple {66863#false} assume 5 == ~blastFlag~0; {66863#false} is VALID [2022-04-28 15:18:32,314 INFO L290 TraceCheckUtils]: 192: Hoare triple {66863#false} assume !false; {66863#false} is VALID [2022-04-28 15:18:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-28 15:18:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:32,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421935278] [2022-04-28 15:18:32,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421935278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:32,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:32,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:32,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:32,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229448714] [2022-04-28 15:18:32,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229448714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:32,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:32,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848039383] [2022-04-28 15:18:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:32,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-28 15:18:32,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:32,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:32,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:32,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:32,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:32,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:32,411 INFO L87 Difference]: Start difference. First operand 1091 states and 1686 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:34,437 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:18:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:35,684 INFO L93 Difference]: Finished difference Result 2542 states and 3875 transitions. [2022-04-28 15:18:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:35,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-28 15:18:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:18:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:18:35,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:18:36,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:36,088 INFO L225 Difference]: With dead ends: 2542 [2022-04-28 15:18:36,088 INFO L226 Difference]: Without dead ends: 1467 [2022-04-28 15:18:36,090 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:36,091 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:36,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-28 15:18:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1091. [2022-04-28 15:18:36,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:36,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call 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:36,169 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call 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:36,170 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call 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:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:36,241 INFO L93 Difference]: Finished difference Result 1467 states and 2188 transitions. [2022-04-28 15:18:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2188 transitions. [2022-04-28 15:18:36,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:36,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:36,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 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 1467 states. [2022-04-28 15:18:36,245 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 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 1467 states. [2022-04-28 15:18:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:36,333 INFO L93 Difference]: Finished difference Result 1467 states and 2188 transitions. [2022-04-28 15:18:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2188 transitions. [2022-04-28 15:18:36,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:36,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:36,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:36,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5294659300184161) internal successors, (1661), 1086 states have internal predecessors, (1661), 3 states have call successors, (3), 3 states have call 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:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1665 transitions. [2022-04-28 15:18:36,423 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1665 transitions. Word has length 193 [2022-04-28 15:18:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:36,423 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1665 transitions. [2022-04-28 15:18:36,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:36,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1665 transitions. [2022-04-28 15:18:37,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1665 transitions. [2022-04-28 15:18:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-28 15:18:37,940 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:37,940 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2022-04-28 15:18:37,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:18:37,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 1 times [2022-04-28 15:18:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150185089] [2022-04-28 15:18:51,689 WARN L232 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:18:59,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 2 times [2022-04-28 15:18:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:59,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650042554] [2022-04-28 15:18:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:59,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {77081#(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); {77074#true} is VALID [2022-04-28 15:18:59,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {77074#true} assume true; {77074#true} is VALID [2022-04-28 15:18:59,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77074#true} {77074#true} #593#return; {77074#true} is VALID [2022-04-28 15:18:59,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {77074#true} call ULTIMATE.init(); {77081#(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:59,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {77081#(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); {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {77074#true} assume true; {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77074#true} {77074#true} #593#return; {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {77074#true} call #t~ret158 := main(); {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {77074#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; {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L272 TraceCheckUtils]: 6: Hoare triple {77074#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {77074#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {77074#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {77074#true} is VALID [2022-04-28 15:18:59,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {77074#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {77074#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {77074#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {77074#true} assume 12292 == #t~mem49;havoc #t~mem49; {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {77074#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {77074#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {77074#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {77074#true} is VALID [2022-04-28 15:18:59,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {77074#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {77074#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {77074#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {77074#true} assume !(0 == ~tmp___4~0); {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {77074#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {77074#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-28 15:18:59,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {77074#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {77074#true} assume 4368 == #t~mem54;havoc #t~mem54; {77074#true} is VALID [2022-04-28 15:18:59,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {77074#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {77074#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {77074#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {77074#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {77074#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-28 15:18:59,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {77074#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {77074#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {77074#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {77074#true} assume 4384 == #t~mem56;havoc #t~mem56; {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {77074#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {77074#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {77074#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {77074#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {77074#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {77074#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-28 15:18:59,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {77074#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {77074#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {77074#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {77074#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {77074#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {77074#true} assume 4400 == #t~mem58;havoc #t~mem58; {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {77074#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {77074#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {77074#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {77074#true} assume !(~ret~0 <= 0); {77074#true} is VALID [2022-04-28 15:18:59,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {77074#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {77074#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {77074#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {77074#true} ~skip~0 := 0; {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {77074#true} assume !false; {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {77074#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {77074#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {77074#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {77074#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {77074#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {77074#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {77074#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 86: Hoare triple {77074#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 87: Hoare triple {77074#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 88: Hoare triple {77074#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {77074#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {77074#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77074#true} is VALID [2022-04-28 15:18:59,881 INFO L290 TraceCheckUtils]: 91: Hoare triple {77074#true} assume 4416 == #t~mem60;havoc #t~mem60; {77074#true} is VALID [2022-04-28 15:18:59,882 INFO L290 TraceCheckUtils]: 92: Hoare triple {77074#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77074#true} is VALID [2022-04-28 15:18:59,882 INFO L290 TraceCheckUtils]: 93: Hoare triple {77074#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {77074#true} is VALID [2022-04-28 15:18:59,883 INFO L290 TraceCheckUtils]: 94: Hoare triple {77074#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); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,883 INFO L290 TraceCheckUtils]: 95: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,884 INFO L290 TraceCheckUtils]: 96: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,884 INFO L290 TraceCheckUtils]: 97: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,885 INFO L290 TraceCheckUtils]: 98: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,885 INFO L290 TraceCheckUtils]: 99: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,885 INFO L290 TraceCheckUtils]: 100: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,886 INFO L290 TraceCheckUtils]: 101: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,886 INFO L290 TraceCheckUtils]: 102: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,887 INFO L290 TraceCheckUtils]: 103: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,887 INFO L290 TraceCheckUtils]: 104: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:18:59,887 INFO L290 TraceCheckUtils]: 105: Hoare triple {77079#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77080#(= |ssl3_connect_#t~mem54| 4432)} is VALID [2022-04-28 15:18:59,888 INFO L290 TraceCheckUtils]: 106: Hoare triple {77080#(= |ssl3_connect_#t~mem54| 4432)} assume 4368 == #t~mem54;havoc #t~mem54; {77075#false} is VALID [2022-04-28 15:18:59,888 INFO L290 TraceCheckUtils]: 107: Hoare triple {77075#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {77075#false} is VALID [2022-04-28 15:18:59,888 INFO L290 TraceCheckUtils]: 108: Hoare triple {77075#false} assume !(0 == ~blastFlag~0); {77075#false} is VALID [2022-04-28 15:18:59,888 INFO L290 TraceCheckUtils]: 109: Hoare triple {77075#false} 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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {77075#false} is VALID [2022-04-28 15:18:59,888 INFO L290 TraceCheckUtils]: 110: Hoare triple {77075#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {77075#false} is VALID [2022-04-28 15:18:59,888 INFO L290 TraceCheckUtils]: 111: Hoare triple {77075#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 112: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 113: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 114: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 115: Hoare triple {77075#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 116: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 117: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 118: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,889 INFO L290 TraceCheckUtils]: 119: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 120: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 121: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 122: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 123: Hoare triple {77075#false} assume 4384 == #t~mem56;havoc #t~mem56; {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 124: Hoare triple {77075#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 125: Hoare triple {77075#false} assume !(1 == ~blastFlag~0); {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 126: Hoare triple {77075#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,890 INFO L290 TraceCheckUtils]: 127: Hoare triple {77075#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 128: Hoare triple {77075#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 129: Hoare triple {77075#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 130: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 131: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 132: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 133: Hoare triple {77075#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 134: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,891 INFO L290 TraceCheckUtils]: 135: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 136: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 137: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 138: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 139: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 140: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 141: Hoare triple {77075#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 142: Hoare triple {77075#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,892 INFO L290 TraceCheckUtils]: 143: Hoare triple {77075#false} assume 4400 == #t~mem58;havoc #t~mem58; {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 144: Hoare triple {77075#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 145: Hoare triple {77075#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 146: Hoare triple {77075#false} assume !(2 == ~blastFlag~0); {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 147: Hoare triple {77075#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 148: Hoare triple {77075#false} assume !(~ret~0 <= 0); {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 149: Hoare triple {77075#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 150: Hoare triple {77075#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 151: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-28 15:18:59,893 INFO L290 TraceCheckUtils]: 152: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 153: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 154: Hoare triple {77075#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 155: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 156: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 157: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 158: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 159: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,894 INFO L290 TraceCheckUtils]: 160: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 161: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 162: Hoare triple {77075#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 163: Hoare triple {77075#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 164: Hoare triple {77075#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 165: Hoare triple {77075#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 166: Hoare triple {77075#false} assume 4416 == #t~mem60;havoc #t~mem60; {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 167: Hoare triple {77075#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77075#false} is VALID [2022-04-28 15:18:59,895 INFO L290 TraceCheckUtils]: 168: Hoare triple {77075#false} assume !(3 == ~blastFlag~0); {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 169: Hoare triple {77075#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); {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 170: Hoare triple {77075#false} assume !(0 == ~tmp___6~0); {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 171: Hoare triple {77075#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 172: Hoare triple {77075#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 173: Hoare triple {77075#false} ~skip~0 := 0; {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 174: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 175: Hoare triple {77075#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 176: Hoare triple {77075#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,896 INFO L290 TraceCheckUtils]: 177: Hoare triple {77075#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 178: Hoare triple {77075#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 179: Hoare triple {77075#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 180: Hoare triple {77075#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 181: Hoare triple {77075#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 182: Hoare triple {77075#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 183: Hoare triple {77075#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 184: Hoare triple {77075#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,897 INFO L290 TraceCheckUtils]: 185: Hoare triple {77075#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 186: Hoare triple {77075#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 187: Hoare triple {77075#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 188: Hoare triple {77075#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 189: Hoare triple {77075#false} assume 4432 == #t~mem62;havoc #t~mem62; {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 190: Hoare triple {77075#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 191: Hoare triple {77075#false} assume 5 == ~blastFlag~0; {77075#false} is VALID [2022-04-28 15:18:59,898 INFO L290 TraceCheckUtils]: 192: Hoare triple {77075#false} assume !false; {77075#false} is VALID [2022-04-28 15:18:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 15:18:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:59,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650042554] [2022-04-28 15:18:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650042554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:59,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:59,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:59,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:59,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150185089] [2022-04-28 15:18:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150185089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:59,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:59,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580852876] [2022-04-28 15:18:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 193 [2022-04-28 15:18:59,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:59,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:59,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:59,996 INFO L87 Difference]: Start difference. First operand 1091 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:02,029 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:19:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:03,552 INFO L93 Difference]: Finished difference Result 2278 states and 3446 transitions. [2022-04-28 15:19:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 193 [2022-04-28 15:19:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:19:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:19:03,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-28 15:19:03,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:03,930 INFO L225 Difference]: With dead ends: 2278 [2022-04-28 15:19:03,930 INFO L226 Difference]: Without dead ends: 1372 [2022-04-28 15:19:03,932 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:19:03,933 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 87 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:03,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 537 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:19:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-28 15:19:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-28 15:19:04,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:04,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call 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:04,022 INFO L74 IsIncluded]: Start isIncluded. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call 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:04,023 INFO L87 Difference]: Start difference. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call 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:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:04,098 INFO L93 Difference]: Finished difference Result 1372 states and 2053 transitions. [2022-04-28 15:19:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2053 transitions. [2022-04-28 15:19:04,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:04,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:04,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 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 1372 states. [2022-04-28 15:19:04,102 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 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 1372 states. [2022-04-28 15:19:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:04,179 INFO L93 Difference]: Finished difference Result 1372 states and 2053 transitions. [2022-04-28 15:19:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2053 transitions. [2022-04-28 15:19:04,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:04,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:04,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:04,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5248618784530388) internal successors, (1656), 1086 states have internal predecessors, (1656), 3 states have call successors, (3), 3 states have call 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:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1660 transitions. [2022-04-28 15:19:04,260 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1660 transitions. Word has length 193 [2022-04-28 15:19:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:04,260 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1660 transitions. [2022-04-28 15:19:04,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:04,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1660 transitions. [2022-04-28 15:19:05,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1660 edges. 1660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1660 transitions. [2022-04-28 15:19:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-28 15:19:05,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:05,835 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:05,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:19:05,836 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1223374947, now seen corresponding path program 1 times [2022-04-28 15:19:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:05,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368779523] [2022-04-28 15:19:19,979 WARN L232 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:19:28,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1223374947, now seen corresponding path program 2 times [2022-04-28 15:19:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:28,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101781214] [2022-04-28 15:19:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:28,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {86575#(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); {86568#true} is VALID [2022-04-28 15:19:28,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {86568#true} assume true; {86568#true} is VALID [2022-04-28 15:19:28,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86568#true} {86568#true} #593#return; {86568#true} is VALID [2022-04-28 15:19:28,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {86568#true} call ULTIMATE.init(); {86575#(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:28,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {86575#(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); {86568#true} is VALID [2022-04-28 15:19:28,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {86568#true} assume true; {86568#true} is VALID [2022-04-28 15:19:28,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86568#true} {86568#true} #593#return; {86568#true} is VALID [2022-04-28 15:19:28,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {86568#true} call #t~ret158 := main(); {86568#true} is VALID [2022-04-28 15:19:28,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {86568#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; {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L272 TraceCheckUtils]: 6: Hoare triple {86568#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {86568#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {86568#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {86568#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {86568#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {86568#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {86568#true} assume 12292 == #t~mem49;havoc #t~mem49; {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {86568#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {86568#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {86568#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {86568#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {86568#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {86568#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {86568#true} is VALID [2022-04-28 15:19:28,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {86568#true} assume !(0 == ~tmp___4~0); {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {86568#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {86568#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {86568#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {86568#true} assume 4368 == #t~mem54;havoc #t~mem54; {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {86568#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {86568#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {86568#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {86568#true} is VALID [2022-04-28 15:19:28,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {86568#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {86568#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {86568#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {86568#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {86568#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {86568#true} assume 4384 == #t~mem56;havoc #t~mem56; {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {86568#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {86568#true} is VALID [2022-04-28 15:19:28,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {86568#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {86568#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {86568#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {86568#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {86568#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-28 15:19:28,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {86568#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {86568#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {86568#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 67: Hoare triple {86568#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {86568#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {86568#true} assume 4400 == #t~mem58;havoc #t~mem58; {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {86568#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {86568#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {86568#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86568#true} is VALID [2022-04-28 15:19:28,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {86568#true} assume !(~ret~0 <= 0); {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 74: Hoare triple {86568#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {86568#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {86568#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {86568#true} ~skip~0 := 0; {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {86568#true} assume !false; {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {86568#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {86568#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {86568#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 82: Hoare triple {86568#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 83: Hoare triple {86568#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 84: Hoare triple {86568#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 85: Hoare triple {86568#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 86: Hoare triple {86568#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 87: Hoare triple {86568#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,797 INFO L290 TraceCheckUtils]: 88: Hoare triple {86568#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {86568#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {86568#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86568#true} is VALID [2022-04-28 15:19:28,798 INFO L290 TraceCheckUtils]: 91: Hoare triple {86568#true} assume 4416 == #t~mem60;havoc #t~mem60; {86568#true} is VALID [2022-04-28 15:19:28,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {86568#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {86568#true} is VALID [2022-04-28 15:19:28,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {86568#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86568#true} is VALID [2022-04-28 15:19:28,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {86568#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); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,800 INFO L290 TraceCheckUtils]: 96: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,801 INFO L290 TraceCheckUtils]: 97: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,801 INFO L290 TraceCheckUtils]: 98: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,802 INFO L290 TraceCheckUtils]: 99: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,802 INFO L290 TraceCheckUtils]: 100: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:19:28,802 INFO L290 TraceCheckUtils]: 101: Hoare triple {86573#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86574#(= |ssl3_connect_#t~mem50| 4432)} is VALID [2022-04-28 15:19:28,803 INFO L290 TraceCheckUtils]: 102: Hoare triple {86574#(= |ssl3_connect_#t~mem50| 4432)} assume 16384 == #t~mem50;havoc #t~mem50; {86569#false} is VALID [2022-04-28 15:19:28,803 INFO L290 TraceCheckUtils]: 103: Hoare triple {86569#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,803 INFO L290 TraceCheckUtils]: 104: Hoare triple {86569#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {86569#false} is VALID [2022-04-28 15:19:28,803 INFO L290 TraceCheckUtils]: 105: Hoare triple {86569#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,803 INFO L290 TraceCheckUtils]: 106: Hoare triple {86569#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 107: Hoare triple {86569#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 108: Hoare triple {86569#false} assume !(0 == ~tmp___4~0); {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {86569#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 110: Hoare triple {86569#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 111: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 112: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 113: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-28 15:19:28,804 INFO L290 TraceCheckUtils]: 114: Hoare triple {86569#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 115: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 116: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 117: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 118: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 119: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 120: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 121: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,805 INFO L290 TraceCheckUtils]: 122: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 123: Hoare triple {86569#false} assume 4385 == #t~mem57;havoc #t~mem57; {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 124: Hoare triple {86569#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 125: Hoare triple {86569#false} assume !(1 == ~blastFlag~0); {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 126: Hoare triple {86569#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 127: Hoare triple {86569#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 128: Hoare triple {86569#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,806 INFO L290 TraceCheckUtils]: 129: Hoare triple {86569#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 130: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 131: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 132: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 133: Hoare triple {86569#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 134: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 135: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 136: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,807 INFO L290 TraceCheckUtils]: 137: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 138: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 139: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 140: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 141: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 142: Hoare triple {86569#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 143: Hoare triple {86569#false} assume 4400 == #t~mem58;havoc #t~mem58; {86569#false} is VALID [2022-04-28 15:19:28,808 INFO L290 TraceCheckUtils]: 144: Hoare triple {86569#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 145: Hoare triple {86569#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 146: Hoare triple {86569#false} assume !(2 == ~blastFlag~0); {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 147: Hoare triple {86569#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 148: Hoare triple {86569#false} assume !(~ret~0 <= 0); {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 149: Hoare triple {86569#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 150: Hoare triple {86569#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,809 INFO L290 TraceCheckUtils]: 151: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 152: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 153: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 154: Hoare triple {86569#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 155: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 156: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 157: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 158: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,810 INFO L290 TraceCheckUtils]: 159: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 160: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 161: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 162: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 163: Hoare triple {86569#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 164: Hoare triple {86569#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 165: Hoare triple {86569#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 166: Hoare triple {86569#false} assume 4416 == #t~mem60;havoc #t~mem60; {86569#false} is VALID [2022-04-28 15:19:28,811 INFO L290 TraceCheckUtils]: 167: Hoare triple {86569#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 168: Hoare triple {86569#false} assume !(3 == ~blastFlag~0); {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 169: Hoare triple {86569#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); {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 170: Hoare triple {86569#false} assume !(0 == ~tmp___6~0); {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 171: Hoare triple {86569#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 172: Hoare triple {86569#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 173: Hoare triple {86569#false} ~skip~0 := 0; {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 174: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-28 15:19:28,812 INFO L290 TraceCheckUtils]: 175: Hoare triple {86569#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 176: Hoare triple {86569#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 177: Hoare triple {86569#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 178: Hoare triple {86569#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 179: Hoare triple {86569#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 180: Hoare triple {86569#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 181: Hoare triple {86569#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,813 INFO L290 TraceCheckUtils]: 182: Hoare triple {86569#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 183: Hoare triple {86569#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 184: Hoare triple {86569#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 185: Hoare triple {86569#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 186: Hoare triple {86569#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 187: Hoare triple {86569#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 188: Hoare triple {86569#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {86569#false} is VALID [2022-04-28 15:19:28,814 INFO L290 TraceCheckUtils]: 189: Hoare triple {86569#false} assume 4432 == #t~mem62;havoc #t~mem62; {86569#false} is VALID [2022-04-28 15:19:28,815 INFO L290 TraceCheckUtils]: 190: Hoare triple {86569#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {86569#false} is VALID [2022-04-28 15:19:28,815 INFO L290 TraceCheckUtils]: 191: Hoare triple {86569#false} assume 5 == ~blastFlag~0; {86569#false} is VALID [2022-04-28 15:19:28,815 INFO L290 TraceCheckUtils]: 192: Hoare triple {86569#false} assume !false; {86569#false} is VALID [2022-04-28 15:19:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-28 15:19:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:28,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101781214] [2022-04-28 15:19:28,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101781214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:28,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:28,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:28,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:28,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368779523] [2022-04-28 15:19:28,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368779523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:28,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099888808] [2022-04-28 15:19:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-28 15:19:28,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:28,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:28,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:28,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:28,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:28,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:28,913 INFO L87 Difference]: Start difference. First operand 1091 states and 1660 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:30,937 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:19:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:32,457 INFO L93 Difference]: Finished difference Result 2447 states and 3693 transitions. [2022-04-28 15:19:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:32,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 193 [2022-04-28 15:19:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:19:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:19:32,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-28 15:19:32,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:32,824 INFO L225 Difference]: With dead ends: 2447 [2022-04-28 15:19:32,824 INFO L226 Difference]: Without dead ends: 1372 [2022-04-28 15:19:32,825 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:19:32,826 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 90 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:32,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 535 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:19:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-28 15:19:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-28 15:19:32,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:32,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call 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:32,914 INFO L74 IsIncluded]: Start isIncluded. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call 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:32,915 INFO L87 Difference]: Start difference. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call 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:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:32,975 INFO L93 Difference]: Finished difference Result 1372 states and 2048 transitions. [2022-04-28 15:19:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2048 transitions. [2022-04-28 15:19:32,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:32,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:32,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 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 1372 states. [2022-04-28 15:19:32,979 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 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 1372 states. [2022-04-28 15:19:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:33,056 INFO L93 Difference]: Finished difference Result 1372 states and 2048 transitions. [2022-04-28 15:19:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2048 transitions. [2022-04-28 15:19:33,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:33,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:33,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:33,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5202578268876612) internal successors, (1651), 1086 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call 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:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1655 transitions. [2022-04-28 15:19:33,138 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1655 transitions. Word has length 193 [2022-04-28 15:19:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:33,138 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1655 transitions. [2022-04-28 15:19:33,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call 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:33,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1655 transitions. [2022-04-28 15:19:34,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1655 edges. 1655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1655 transitions. [2022-04-28 15:19:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-28 15:19:34,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:34,664 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:34,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:19:34,664 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1166019930, now seen corresponding path program 1 times [2022-04-28 15:19:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:34,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594702327] [2022-04-28 15:19:45,323 WARN L232 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:20:00,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1166019930, now seen corresponding path program 2 times [2022-04-28 15:20:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:00,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148485650] [2022-04-28 15:20:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:00,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {96407#(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); {96400#true} is VALID [2022-04-28 15:20:00,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {96400#true} assume true; {96400#true} is VALID [2022-04-28 15:20:00,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96400#true} {96400#true} #593#return; {96400#true} is VALID [2022-04-28 15:20:00,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {96400#true} call ULTIMATE.init(); {96407#(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:00,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {96407#(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); {96400#true} is VALID [2022-04-28 15:20:00,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {96400#true} assume true; {96400#true} is VALID [2022-04-28 15:20:00,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96400#true} {96400#true} #593#return; {96400#true} is VALID [2022-04-28 15:20:00,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {96400#true} call #t~ret158 := main(); {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {96400#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; {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {96400#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {96400#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {96400#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {96400#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {96400#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-28 15:20:00,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {96400#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {96400#true} assume 12292 == #t~mem49;havoc #t~mem49; {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {96400#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {96400#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {96400#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {96400#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {96400#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {96400#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {96400#true} is VALID [2022-04-28 15:20:00,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {96400#true} assume !(0 == ~tmp___4~0); {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {96400#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {96400#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {96400#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {96400#true} assume 4368 == #t~mem54;havoc #t~mem54; {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {96400#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {96400#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {96400#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {96400#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {96400#true} is VALID [2022-04-28 15:20:00,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {96400#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {96400#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {96400#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {96400#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {96400#true} assume 4384 == #t~mem56;havoc #t~mem56; {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {96400#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 51: Hoare triple {96400#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {96400#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {96400#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {96400#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {96400#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {96400#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 65: Hoare triple {96400#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 66: Hoare triple {96400#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 67: Hoare triple {96400#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 68: Hoare triple {96400#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {96400#true} assume 4400 == #t~mem58;havoc #t~mem58; {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {96400#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {96400#true} is VALID [2022-04-28 15:20:00,288 INFO L290 TraceCheckUtils]: 71: Hoare triple {96400#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {96400#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {96400#true} assume !(~ret~0 <= 0); {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {96400#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {96400#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {96400#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {96400#true} ~skip~0 := 0; {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {96400#true} assume !false; {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {96400#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,289 INFO L290 TraceCheckUtils]: 80: Hoare triple {96400#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 81: Hoare triple {96400#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 82: Hoare triple {96400#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 83: Hoare triple {96400#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 84: Hoare triple {96400#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 85: Hoare triple {96400#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 86: Hoare triple {96400#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 87: Hoare triple {96400#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,290 INFO L290 TraceCheckUtils]: 88: Hoare triple {96400#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,291 INFO L290 TraceCheckUtils]: 89: Hoare triple {96400#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,291 INFO L290 TraceCheckUtils]: 90: Hoare triple {96400#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96400#true} is VALID [2022-04-28 15:20:00,291 INFO L290 TraceCheckUtils]: 91: Hoare triple {96400#true} assume 4416 == #t~mem60;havoc #t~mem60; {96400#true} is VALID [2022-04-28 15:20:00,291 INFO L290 TraceCheckUtils]: 92: Hoare triple {96400#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96400#true} is VALID [2022-04-28 15:20:00,291 INFO L290 TraceCheckUtils]: 93: Hoare triple {96400#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {96400#true} is VALID [2022-04-28 15:20:00,292 INFO L290 TraceCheckUtils]: 94: Hoare triple {96400#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); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,293 INFO L290 TraceCheckUtils]: 95: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,293 INFO L290 TraceCheckUtils]: 96: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,294 INFO L290 TraceCheckUtils]: 97: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,294 INFO L290 TraceCheckUtils]: 98: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,295 INFO L290 TraceCheckUtils]: 100: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,295 INFO L290 TraceCheckUtils]: 101: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:00,296 INFO L290 TraceCheckUtils]: 102: Hoare triple {96405#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96406#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-28 15:20:00,296 INFO L290 TraceCheckUtils]: 103: Hoare triple {96406#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {96401#false} is VALID [2022-04-28 15:20:00,296 INFO L290 TraceCheckUtils]: 104: Hoare triple {96401#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,296 INFO L290 TraceCheckUtils]: 105: Hoare triple {96401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {96401#false} is VALID [2022-04-28 15:20:00,296 INFO L290 TraceCheckUtils]: 106: Hoare triple {96401#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 107: Hoare triple {96401#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 108: Hoare triple {96401#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 109: Hoare triple {96401#false} assume !(0 == ~tmp___4~0); {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 110: Hoare triple {96401#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 111: Hoare triple {96401#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 112: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 113: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-28 15:20:00,297 INFO L290 TraceCheckUtils]: 114: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 115: Hoare triple {96401#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 116: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 117: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 118: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 119: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 120: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 121: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,298 INFO L290 TraceCheckUtils]: 122: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 123: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 124: Hoare triple {96401#false} assume 4385 == #t~mem57;havoc #t~mem57; {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 125: Hoare triple {96401#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 126: Hoare triple {96401#false} assume !(1 == ~blastFlag~0); {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 127: Hoare triple {96401#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 128: Hoare triple {96401#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 129: Hoare triple {96401#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,299 INFO L290 TraceCheckUtils]: 130: Hoare triple {96401#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 131: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 132: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 133: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 134: Hoare triple {96401#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 135: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 136: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 137: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 138: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,300 INFO L290 TraceCheckUtils]: 139: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 140: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 141: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 142: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 143: Hoare triple {96401#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 144: Hoare triple {96401#false} assume 4400 == #t~mem58;havoc #t~mem58; {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 145: Hoare triple {96401#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 146: Hoare triple {96401#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {96401#false} is VALID [2022-04-28 15:20:00,301 INFO L290 TraceCheckUtils]: 147: Hoare triple {96401#false} assume !(2 == ~blastFlag~0); {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 148: Hoare triple {96401#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 149: Hoare triple {96401#false} assume !(~ret~0 <= 0); {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 150: Hoare triple {96401#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 151: Hoare triple {96401#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 152: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 153: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 154: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 155: Hoare triple {96401#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,302 INFO L290 TraceCheckUtils]: 156: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 157: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 158: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 159: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 160: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 161: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 162: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 163: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,303 INFO L290 TraceCheckUtils]: 164: Hoare triple {96401#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 165: Hoare triple {96401#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 166: Hoare triple {96401#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 167: Hoare triple {96401#false} assume 4416 == #t~mem60;havoc #t~mem60; {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 168: Hoare triple {96401#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 169: Hoare triple {96401#false} assume !(3 == ~blastFlag~0); {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 170: Hoare triple {96401#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); {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 171: Hoare triple {96401#false} assume !(0 == ~tmp___6~0); {96401#false} is VALID [2022-04-28 15:20:00,304 INFO L290 TraceCheckUtils]: 172: Hoare triple {96401#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 173: Hoare triple {96401#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 174: Hoare triple {96401#false} ~skip~0 := 0; {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 175: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 176: Hoare triple {96401#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 177: Hoare triple {96401#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 178: Hoare triple {96401#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 179: Hoare triple {96401#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 180: Hoare triple {96401#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,305 INFO L290 TraceCheckUtils]: 181: Hoare triple {96401#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 182: Hoare triple {96401#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 183: Hoare triple {96401#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 184: Hoare triple {96401#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 185: Hoare triple {96401#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 186: Hoare triple {96401#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 187: Hoare triple {96401#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 188: Hoare triple {96401#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,306 INFO L290 TraceCheckUtils]: 189: Hoare triple {96401#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96401#false} is VALID [2022-04-28 15:20:00,307 INFO L290 TraceCheckUtils]: 190: Hoare triple {96401#false} assume 4432 == #t~mem62;havoc #t~mem62; {96401#false} is VALID [2022-04-28 15:20:00,307 INFO L290 TraceCheckUtils]: 191: Hoare triple {96401#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {96401#false} is VALID [2022-04-28 15:20:00,307 INFO L290 TraceCheckUtils]: 192: Hoare triple {96401#false} assume 5 == ~blastFlag~0; {96401#false} is VALID [2022-04-28 15:20:00,307 INFO L290 TraceCheckUtils]: 193: Hoare triple {96401#false} assume !false; {96401#false} is VALID [2022-04-28 15:20:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-28 15:20:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:00,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148485650] [2022-04-28 15:20:00,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148485650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:00,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:00,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:00,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:00,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594702327] [2022-04-28 15:20:00,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594702327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:00,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:00,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217457048] [2022-04-28 15:20:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:00,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 194 [2022-04-28 15:20:00,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:00,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:00,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:00,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:00,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:00,415 INFO L87 Difference]: Start difference. First operand 1091 states and 1655 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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,444 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:20:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:04,003 INFO L93 Difference]: Finished difference Result 2447 states and 3683 transitions. [2022-04-28 15:20:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 194 [2022-04-28 15:20:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:20:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:20:04,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:20:04,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:04,381 INFO L225 Difference]: With dead ends: 2447 [2022-04-28 15:20:04,381 INFO L226 Difference]: Without dead ends: 1372 [2022-04-28 15:20:04,383 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:04,383 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 88 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:04,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 533 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:20:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-04-28 15:20:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1091. [2022-04-28 15:20:04,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:04,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call 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:04,460 INFO L74 IsIncluded]: Start isIncluded. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call 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:04,461 INFO L87 Difference]: Start difference. First operand 1372 states. Second operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call 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:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:04,515 INFO L93 Difference]: Finished difference Result 1372 states and 2043 transitions. [2022-04-28 15:20:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2043 transitions. [2022-04-28 15:20:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:04,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 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 1372 states. [2022-04-28 15:20:04,518 INFO L87 Difference]: Start difference. First operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 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 1372 states. [2022-04-28 15:20:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:04,593 INFO L93 Difference]: Finished difference Result 1372 states and 2043 transitions. [2022-04-28 15:20:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2043 transitions. [2022-04-28 15:20:04,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:04,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:04,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:04,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1086 states have (on average 1.5156537753222836) internal successors, (1646), 1086 states have internal predecessors, (1646), 3 states have call successors, (3), 3 states have call 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:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1650 transitions. [2022-04-28 15:20:04,669 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1650 transitions. Word has length 194 [2022-04-28 15:20:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:04,669 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1650 transitions. [2022-04-28 15:20:04,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call 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:04,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1091 states and 1650 transitions. [2022-04-28 15:20:06,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1650 edges. 1650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1650 transitions. [2022-04-28 15:20:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-28 15:20:06,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:06,222 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 3, 3, 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] [2022-04-28 15:20:06,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:20:06,222 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 1 times [2022-04-28 15:20:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:06,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888837518] [2022-04-28 15:20:19,061 WARN L232 SmtUtils]: Spent 7.48s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:20:27,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 2 times [2022-04-28 15:20:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:27,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920463466] [2022-04-28 15:20:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:28,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {106239#(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); {106232#true} is VALID [2022-04-28 15:20:28,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {106232#true} assume true; {106232#true} is VALID [2022-04-28 15:20:28,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106232#true} {106232#true} #593#return; {106232#true} is VALID [2022-04-28 15:20:28,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {106232#true} call ULTIMATE.init(); {106239#(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:28,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {106239#(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); {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {106232#true} assume true; {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106232#true} {106232#true} #593#return; {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {106232#true} call #t~ret158 := main(); {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {106232#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; {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L272 TraceCheckUtils]: 6: Hoare triple {106232#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {106232#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {106232#true} is VALID [2022-04-28 15:20:28,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {106232#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {106232#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {106232#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {106232#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {106232#true} assume 12292 == #t~mem49;havoc #t~mem49; {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {106232#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {106232#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {106232#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {106232#true} is VALID [2022-04-28 15:20:28,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {106232#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {106232#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {106232#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {106232#true} assume !(0 == ~tmp___4~0); {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {106232#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {106232#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-28 15:20:28,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {106232#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {106232#true} assume 4368 == #t~mem54;havoc #t~mem54; {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {106232#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {106232#true} is VALID [2022-04-28 15:20:28,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {106232#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {106232#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {106232#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {106232#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {106232#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {106232#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {106232#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {106232#true} assume 4384 == #t~mem56;havoc #t~mem56; {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {106232#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {106232#true} is VALID [2022-04-28 15:20:28,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {106232#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {106232#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {106232#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {106232#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {106232#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-28 15:20:28,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {106232#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {106232#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {106232#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {106232#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {106232#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {106232#true} assume 4400 == #t~mem58;havoc #t~mem58; {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 70: Hoare triple {106232#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {106232#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {106232#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {106232#true} assume !(~ret~0 <= 0); {106232#true} is VALID [2022-04-28 15:20:28,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {106232#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 75: Hoare triple {106232#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {106232#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {106232#true} ~skip~0 := 0; {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 78: Hoare triple {106232#true} assume !false; {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {106232#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {106232#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {106232#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {106232#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {106232#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {106232#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {106232#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {106232#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {106232#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {106232#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {106232#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {106232#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {106232#true} assume 4416 == #t~mem60;havoc #t~mem60; {106232#true} is VALID [2022-04-28 15:20:28,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {106232#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {106232#true} is VALID [2022-04-28 15:20:28,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {106232#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {106232#true} is VALID [2022-04-28 15:20:28,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {106232#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); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,146 INFO L290 TraceCheckUtils]: 96: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,146 INFO L290 TraceCheckUtils]: 98: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,147 INFO L290 TraceCheckUtils]: 99: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,147 INFO L290 TraceCheckUtils]: 100: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,148 INFO L290 TraceCheckUtils]: 101: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,149 INFO L290 TraceCheckUtils]: 104: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,149 INFO L290 TraceCheckUtils]: 105: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:20:28,150 INFO L290 TraceCheckUtils]: 106: Hoare triple {106237#(not (= 4369 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106238#(not (= 4369 |ssl3_connect_#t~mem55|))} is VALID [2022-04-28 15:20:28,150 INFO L290 TraceCheckUtils]: 107: Hoare triple {106238#(not (= 4369 |ssl3_connect_#t~mem55|))} assume 4369 == #t~mem55;havoc #t~mem55; {106233#false} is VALID [2022-04-28 15:20:28,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {106233#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {106233#false} is VALID [2022-04-28 15:20:28,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {106233#false} assume !(0 == ~blastFlag~0); {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 110: Hoare triple {106233#false} 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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 111: Hoare triple {106233#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 112: Hoare triple {106233#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 115: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 116: Hoare triple {106233#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,151 INFO L290 TraceCheckUtils]: 117: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 118: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 119: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 120: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 121: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 122: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 123: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 124: Hoare triple {106233#false} assume 4384 == #t~mem56;havoc #t~mem56; {106233#false} is VALID [2022-04-28 15:20:28,152 INFO L290 TraceCheckUtils]: 125: Hoare triple {106233#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 126: Hoare triple {106233#false} assume !(1 == ~blastFlag~0); {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 127: Hoare triple {106233#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 128: Hoare triple {106233#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 129: Hoare triple {106233#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 130: Hoare triple {106233#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 131: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 132: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-28 15:20:28,153 INFO L290 TraceCheckUtils]: 133: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 134: Hoare triple {106233#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 135: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 136: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 137: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 138: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 139: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 140: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 141: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,154 INFO L290 TraceCheckUtils]: 142: Hoare triple {106233#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 143: Hoare triple {106233#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 144: Hoare triple {106233#false} assume 4400 == #t~mem58;havoc #t~mem58; {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 145: Hoare triple {106233#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 146: Hoare triple {106233#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 147: Hoare triple {106233#false} assume !(2 == ~blastFlag~0); {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 148: Hoare triple {106233#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {106233#false} is VALID [2022-04-28 15:20:28,155 INFO L290 TraceCheckUtils]: 149: Hoare triple {106233#false} assume !(~ret~0 <= 0); {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 150: Hoare triple {106233#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 151: Hoare triple {106233#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 152: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 153: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 154: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 155: Hoare triple {106233#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 156: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,156 INFO L290 TraceCheckUtils]: 157: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 158: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 159: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 160: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 161: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 162: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 163: Hoare triple {106233#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 164: Hoare triple {106233#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,157 INFO L290 TraceCheckUtils]: 165: Hoare triple {106233#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 166: Hoare triple {106233#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 167: Hoare triple {106233#false} assume 4416 == #t~mem60;havoc #t~mem60; {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 168: Hoare triple {106233#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 169: Hoare triple {106233#false} assume !(3 == ~blastFlag~0); {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 170: Hoare triple {106233#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); {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 171: Hoare triple {106233#false} assume !(0 == ~tmp___6~0); {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 172: Hoare triple {106233#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,158 INFO L290 TraceCheckUtils]: 173: Hoare triple {106233#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 174: Hoare triple {106233#false} ~skip~0 := 0; {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 175: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 176: Hoare triple {106233#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 177: Hoare triple {106233#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 178: Hoare triple {106233#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 179: Hoare triple {106233#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 180: Hoare triple {106233#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 181: Hoare triple {106233#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,159 INFO L290 TraceCheckUtils]: 182: Hoare triple {106233#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 183: Hoare triple {106233#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 184: Hoare triple {106233#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 185: Hoare triple {106233#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 186: Hoare triple {106233#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 187: Hoare triple {106233#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 188: Hoare triple {106233#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 189: Hoare triple {106233#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {106233#false} is VALID [2022-04-28 15:20:28,160 INFO L290 TraceCheckUtils]: 190: Hoare triple {106233#false} assume 4432 == #t~mem62;havoc #t~mem62; {106233#false} is VALID [2022-04-28 15:20:28,161 INFO L290 TraceCheckUtils]: 191: Hoare triple {106233#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {106233#false} is VALID [2022-04-28 15:20:28,161 INFO L290 TraceCheckUtils]: 192: Hoare triple {106233#false} assume 5 == ~blastFlag~0; {106233#false} is VALID [2022-04-28 15:20:28,161 INFO L290 TraceCheckUtils]: 193: Hoare triple {106233#false} assume !false; {106233#false} is VALID [2022-04-28 15:20:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 15:20:28,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920463466] [2022-04-28 15:20:28,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920463466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:28,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:28,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:28,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888837518] [2022-04-28 15:20:28,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888837518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:28,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:28,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452336984] [2022-04-28 15:20:28,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 194 [2022-04-28 15:20:28,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:28,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:28,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:28,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:28,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:28,284 INFO L87 Difference]: Start difference. First operand 1091 states and 1650 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:30,311 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:20:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:31,831 INFO L93 Difference]: Finished difference Result 2524 states and 3784 transitions. [2022-04-28 15:20:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 194 [2022-04-28 15:20:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 15:20:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 15:20:31,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 15:20:32,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:32,262 INFO L225 Difference]: With dead ends: 2524 [2022-04-28 15:20:32,262 INFO L226 Difference]: Without dead ends: 1618 [2022-04-28 15:20:32,263 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:32,264 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 112 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:32,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 484 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:20:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-04-28 15:20:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1193. [2022-04-28 15:20:32,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:32,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1618 states. Second operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call 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:32,361 INFO L74 IsIncluded]: Start isIncluded. First operand 1618 states. Second operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call 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:32,362 INFO L87 Difference]: Start difference. First operand 1618 states. Second operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call 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:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:32,476 INFO L93 Difference]: Finished difference Result 1618 states and 2387 transitions. [2022-04-28 15:20:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2387 transitions. [2022-04-28 15:20:32,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:32,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:32,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 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 1618 states. [2022-04-28 15:20:32,481 INFO L87 Difference]: Start difference. First operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 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 1618 states. [2022-04-28 15:20:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:32,604 INFO L93 Difference]: Finished difference Result 1618 states and 2387 transitions. [2022-04-28 15:20:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2387 transitions. [2022-04-28 15:20:32,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:32,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:32,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:32,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1188 states have (on average 1.5092592592592593) internal successors, (1793), 1188 states have internal predecessors, (1793), 3 states have call successors, (3), 3 states have call 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:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1797 transitions. [2022-04-28 15:20:32,695 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1797 transitions. Word has length 194 [2022-04-28 15:20:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:32,696 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1797 transitions. [2022-04-28 15:20:32,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:32,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1797 transitions. [2022-04-28 15:20:34,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1797 edges. 1797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1797 transitions. [2022-04-28 15:20:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-28 15:20:34,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:34,426 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:34,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:20:34,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1168473336, now seen corresponding path program 1 times [2022-04-28 15:20:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:34,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962607236] [2022-04-28 15:20:49,774 WARN L232 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:20:59,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:59,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1168473336, now seen corresponding path program 2 times [2022-04-28 15:20:59,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:59,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042428039] [2022-04-28 15:20:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:59,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:59,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {116921#(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); {116914#true} is VALID [2022-04-28 15:20:59,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {116914#true} assume true; {116914#true} is VALID [2022-04-28 15:20:59,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116914#true} {116914#true} #593#return; {116914#true} is VALID [2022-04-28 15:20:59,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {116914#true} call ULTIMATE.init(); {116921#(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:59,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {116921#(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); {116914#true} is VALID [2022-04-28 15:20:59,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {116914#true} assume true; {116914#true} is VALID [2022-04-28 15:20:59,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116914#true} {116914#true} #593#return; {116914#true} is VALID [2022-04-28 15:20:59,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {116914#true} call #t~ret158 := main(); {116914#true} is VALID [2022-04-28 15:20:59,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {116914#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; {116914#true} is VALID [2022-04-28 15:20:59,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {116914#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {116914#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {116914#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {116914#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {116914#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {116914#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {116914#true} assume 12292 == #t~mem49;havoc #t~mem49; {116914#true} is VALID [2022-04-28 15:20:59,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {116914#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {116914#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {116914#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {116914#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {116914#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {116914#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {116914#true} assume !(0 == ~tmp___4~0); {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {116914#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {116914#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {116914#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {116914#true} assume 4368 == #t~mem54;havoc #t~mem54; {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {116914#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {116914#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {116914#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {116914#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {116914#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {116914#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {116914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {116914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {116914#true} assume 4384 == #t~mem56;havoc #t~mem56; {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {116914#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {116914#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {116914#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {116914#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {116914#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {116914#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {116914#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {116914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {116914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {116914#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {116914#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {116914#true} assume 4400 == #t~mem58;havoc #t~mem58; {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {116914#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 71: Hoare triple {116914#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116914#true} is VALID [2022-04-28 15:20:59,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {116914#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 73: Hoare triple {116914#true} assume !(~ret~0 <= 0); {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {116914#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 75: Hoare triple {116914#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 76: Hoare triple {116914#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 77: Hoare triple {116914#true} ~skip~0 := 0; {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {116914#true} assume !false; {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 79: Hoare triple {116914#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {116914#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 81: Hoare triple {116914#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 82: Hoare triple {116914#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {116914#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {116914#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {116914#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {116914#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {116914#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 88: Hoare triple {116914#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {116914#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,244 INFO L290 TraceCheckUtils]: 90: Hoare triple {116914#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {116914#true} is VALID [2022-04-28 15:20:59,244 INFO L290 TraceCheckUtils]: 91: Hoare triple {116914#true} assume 4416 == #t~mem60;havoc #t~mem60; {116914#true} is VALID [2022-04-28 15:20:59,244 INFO L290 TraceCheckUtils]: 92: Hoare triple {116914#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116914#true} is VALID [2022-04-28 15:20:59,244 INFO L290 TraceCheckUtils]: 93: Hoare triple {116914#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116914#true} is VALID [2022-04-28 15:20:59,245 INFO L290 TraceCheckUtils]: 94: Hoare triple {116914#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); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,246 INFO L290 TraceCheckUtils]: 95: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,246 INFO L290 TraceCheckUtils]: 96: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,246 INFO L290 TraceCheckUtils]: 97: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,247 INFO L290 TraceCheckUtils]: 98: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,247 INFO L290 TraceCheckUtils]: 99: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,248 INFO L290 TraceCheckUtils]: 100: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,248 INFO L290 TraceCheckUtils]: 101: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,249 INFO L290 TraceCheckUtils]: 102: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:20:59,249 INFO L290 TraceCheckUtils]: 103: Hoare triple {116919#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116920#(= |ssl3_connect_#t~mem52| 4432)} is VALID [2022-04-28 15:20:59,249 INFO L290 TraceCheckUtils]: 104: Hoare triple {116920#(= |ssl3_connect_#t~mem52| 4432)} assume 20480 == #t~mem52;havoc #t~mem52; {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 105: Hoare triple {116915#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 106: Hoare triple {116915#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 107: Hoare triple {116915#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 108: Hoare triple {116915#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 109: Hoare triple {116915#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 110: Hoare triple {116915#false} assume !(0 == ~tmp___4~0); {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 111: Hoare triple {116915#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,250 INFO L290 TraceCheckUtils]: 112: Hoare triple {116915#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 113: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 114: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 115: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 116: Hoare triple {116915#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 117: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 118: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 119: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,251 INFO L290 TraceCheckUtils]: 120: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 121: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 122: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 123: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 124: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 125: Hoare triple {116915#false} assume 4385 == #t~mem57;havoc #t~mem57; {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 126: Hoare triple {116915#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 127: Hoare triple {116915#false} assume !(1 == ~blastFlag~0); {116915#false} is VALID [2022-04-28 15:20:59,252 INFO L290 TraceCheckUtils]: 128: Hoare triple {116915#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 129: Hoare triple {116915#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 130: Hoare triple {116915#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 131: Hoare triple {116915#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 132: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 133: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 134: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 135: Hoare triple {116915#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 136: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,253 INFO L290 TraceCheckUtils]: 137: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 138: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 139: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 140: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 141: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 142: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 143: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 144: Hoare triple {116915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,254 INFO L290 TraceCheckUtils]: 145: Hoare triple {116915#false} assume 4400 == #t~mem58;havoc #t~mem58; {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 146: Hoare triple {116915#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 147: Hoare triple {116915#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 148: Hoare triple {116915#false} assume !(2 == ~blastFlag~0); {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 149: Hoare triple {116915#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 150: Hoare triple {116915#false} assume !(~ret~0 <= 0); {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 151: Hoare triple {116915#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 152: Hoare triple {116915#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,255 INFO L290 TraceCheckUtils]: 153: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 154: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 155: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 156: Hoare triple {116915#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 157: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 158: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 159: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 160: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 161: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,256 INFO L290 TraceCheckUtils]: 162: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 163: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 164: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 165: Hoare triple {116915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 166: Hoare triple {116915#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 167: Hoare triple {116915#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 168: Hoare triple {116915#false} assume 4416 == #t~mem60;havoc #t~mem60; {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 169: Hoare triple {116915#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116915#false} is VALID [2022-04-28 15:20:59,257 INFO L290 TraceCheckUtils]: 170: Hoare triple {116915#false} assume !(3 == ~blastFlag~0); {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 171: Hoare triple {116915#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); {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 172: Hoare triple {116915#false} assume !(0 == ~tmp___6~0); {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 173: Hoare triple {116915#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 174: Hoare triple {116915#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 175: Hoare triple {116915#false} ~skip~0 := 0; {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 176: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 177: Hoare triple {116915#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 178: Hoare triple {116915#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,258 INFO L290 TraceCheckUtils]: 179: Hoare triple {116915#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 180: Hoare triple {116915#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 181: Hoare triple {116915#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 182: Hoare triple {116915#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 183: Hoare triple {116915#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 184: Hoare triple {116915#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 185: Hoare triple {116915#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 186: Hoare triple {116915#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,259 INFO L290 TraceCheckUtils]: 187: Hoare triple {116915#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 188: Hoare triple {116915#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 189: Hoare triple {116915#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 190: Hoare triple {116915#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 191: Hoare triple {116915#false} assume 4432 == #t~mem62;havoc #t~mem62; {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 192: Hoare triple {116915#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 193: Hoare triple {116915#false} assume 5 == ~blastFlag~0; {116915#false} is VALID [2022-04-28 15:20:59,260 INFO L290 TraceCheckUtils]: 194: Hoare triple {116915#false} assume !false; {116915#false} is VALID [2022-04-28 15:20:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-28 15:20:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:59,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042428039] [2022-04-28 15:20:59,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042428039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:59,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:59,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:59,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:59,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1962607236] [2022-04-28 15:20:59,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1962607236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:59,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:59,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829090448] [2022-04-28 15:20:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 195 [2022-04-28 15:20:59,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:59,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:59,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:59,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:59,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:59,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:59,380 INFO L87 Difference]: Start difference. First operand 1193 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:01,405 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:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:03,023 INFO L93 Difference]: Finished difference Result 2637 states and 3952 transitions. [2022-04-28 15:21:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:03,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 195 [2022-04-28 15:21:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:21:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:21:03,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 15:21:03,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:03,421 INFO L225 Difference]: With dead ends: 2637 [2022-04-28 15:21:03,421 INFO L226 Difference]: Without dead ends: 1460 [2022-04-28 15:21:03,423 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:03,423 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 83 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:03,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 525 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:21:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2022-04-28 15:21:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1193. [2022-04-28 15:21:03,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:03,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1460 states. Second operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call 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:03,516 INFO L74 IsIncluded]: Start isIncluded. First operand 1460 states. Second operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call 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:03,517 INFO L87 Difference]: Start difference. First operand 1460 states. Second operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call 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:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:03,569 INFO L93 Difference]: Finished difference Result 1460 states and 2170 transitions. [2022-04-28 15:21:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2170 transitions. [2022-04-28 15:21:03,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:03,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:03,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 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 1460 states. [2022-04-28 15:21:03,573 INFO L87 Difference]: Start difference. First operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 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 1460 states. [2022-04-28 15:21:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:03,625 INFO L93 Difference]: Finished difference Result 1460 states and 2170 transitions. [2022-04-28 15:21:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2170 transitions. [2022-04-28 15:21:03,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:03,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:03,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:03,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1188 states have (on average 1.505050505050505) internal successors, (1788), 1188 states have internal predecessors, (1788), 3 states have call successors, (3), 3 states have call 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:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1792 transitions. [2022-04-28 15:21:03,691 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1792 transitions. Word has length 195 [2022-04-28 15:21:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:03,691 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1792 transitions. [2022-04-28 15:21:03,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call 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:03,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1792 transitions. [2022-04-28 15:21:05,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1792 edges. 1792 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1792 transitions. [2022-04-28 15:21:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-28 15:21:05,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:05,383 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:21:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:21:05,383 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1079808289, now seen corresponding path program 1 times [2022-04-28 15:21:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:05,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958919873] [2022-04-28 15:21:17,823 WARN L232 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:21:25,721 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1079808289, now seen corresponding path program 2 times [2022-04-28 15:21:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:25,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494075817] [2022-04-28 15:21:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:25,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {127513#(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); {127506#true} is VALID [2022-04-28 15:21:25,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {127506#true} assume true; {127506#true} is VALID [2022-04-28 15:21:25,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127506#true} {127506#true} #593#return; {127506#true} is VALID [2022-04-28 15:21:25,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {127506#true} call ULTIMATE.init(); {127513#(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:25,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {127513#(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); {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {127506#true} assume true; {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127506#true} {127506#true} #593#return; {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {127506#true} call #t~ret158 := main(); {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {127506#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; {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {127506#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {127506#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {127506#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {127506#true} is VALID [2022-04-28 15:21:25,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {127506#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {127506#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {127506#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {127506#true} assume 12292 == #t~mem49;havoc #t~mem49; {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {127506#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {127506#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {127506#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {127506#true} is VALID [2022-04-28 15:21:25,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {127506#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {127506#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {127506#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {127506#true} assume !(0 == ~tmp___4~0); {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {127506#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {127506#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-28 15:21:25,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {127506#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {127506#true} assume 4368 == #t~mem54;havoc #t~mem54; {127506#true} is VALID [2022-04-28 15:21:25,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {127506#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {127506#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {127506#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {127506#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {127506#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-28 15:21:25,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {127506#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {127506#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {127506#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {127506#true} assume 4384 == #t~mem56;havoc #t~mem56; {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {127506#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {127506#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {127506#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {127506#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {127506#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {127506#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {127506#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {127506#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {127506#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 67: Hoare triple {127506#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {127506#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {127506#true} assume 4400 == #t~mem58;havoc #t~mem58; {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {127506#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 71: Hoare triple {127506#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {127506#true} is VALID [2022-04-28 15:21:25,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {127506#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 73: Hoare triple {127506#true} assume !(~ret~0 <= 0); {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {127506#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {127506#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {127506#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {127506#true} ~skip~0 := 0; {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {127506#true} assume !false; {127506#true} is VALID [2022-04-28 15:21:25,938 INFO L290 TraceCheckUtils]: 79: Hoare triple {127506#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {127506#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {127506#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {127506#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 83: Hoare triple {127506#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 84: Hoare triple {127506#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 85: Hoare triple {127506#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 86: Hoare triple {127506#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,939 INFO L290 TraceCheckUtils]: 87: Hoare triple {127506#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {127506#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {127506#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {127506#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {127506#true} is VALID [2022-04-28 15:21:25,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {127506#true} assume 4416 == #t~mem60;havoc #t~mem60; {127506#true} is VALID [2022-04-28 15:21:25,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {127506#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {127506#true} is VALID [2022-04-28 15:21:25,940 INFO L290 TraceCheckUtils]: 93: Hoare triple {127506#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {127506#true} is VALID [2022-04-28 15:21:25,941 INFO L290 TraceCheckUtils]: 94: Hoare triple {127506#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); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,943 INFO L290 TraceCheckUtils]: 97: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,945 INFO L290 TraceCheckUtils]: 102: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,945 INFO L290 TraceCheckUtils]: 103: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:21:25,946 INFO L290 TraceCheckUtils]: 104: Hoare triple {127511#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127512#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-28 15:21:25,946 INFO L290 TraceCheckUtils]: 105: Hoare triple {127512#(= |ssl3_connect_#t~mem53| 4432)} assume 4099 == #t~mem53;havoc #t~mem53; {127507#false} is VALID [2022-04-28 15:21:25,946 INFO L290 TraceCheckUtils]: 106: Hoare triple {127507#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,946 INFO L290 TraceCheckUtils]: 107: Hoare triple {127507#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {127507#false} is VALID [2022-04-28 15:21:25,946 INFO L290 TraceCheckUtils]: 108: Hoare triple {127507#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 109: Hoare triple {127507#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 110: Hoare triple {127507#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 111: Hoare triple {127507#false} assume !(0 == ~tmp___4~0); {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 112: Hoare triple {127507#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 113: Hoare triple {127507#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 114: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 115: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-28 15:21:25,947 INFO L290 TraceCheckUtils]: 116: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 117: Hoare triple {127507#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 118: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 119: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 120: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 121: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 122: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 123: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,948 INFO L290 TraceCheckUtils]: 124: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 125: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 126: Hoare triple {127507#false} assume 4385 == #t~mem57;havoc #t~mem57; {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 127: Hoare triple {127507#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 128: Hoare triple {127507#false} assume !(1 == ~blastFlag~0); {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 129: Hoare triple {127507#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 130: Hoare triple {127507#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 131: Hoare triple {127507#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,949 INFO L290 TraceCheckUtils]: 132: Hoare triple {127507#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 133: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 134: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 135: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 136: Hoare triple {127507#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 137: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 138: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 139: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 140: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,950 INFO L290 TraceCheckUtils]: 141: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 142: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 143: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 144: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 145: Hoare triple {127507#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 146: Hoare triple {127507#false} assume 4400 == #t~mem58;havoc #t~mem58; {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 147: Hoare triple {127507#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 148: Hoare triple {127507#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {127507#false} is VALID [2022-04-28 15:21:25,951 INFO L290 TraceCheckUtils]: 149: Hoare triple {127507#false} assume !(2 == ~blastFlag~0); {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 150: Hoare triple {127507#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 151: Hoare triple {127507#false} assume !(~ret~0 <= 0); {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 152: Hoare triple {127507#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 153: Hoare triple {127507#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 154: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 155: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 156: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-28 15:21:25,952 INFO L290 TraceCheckUtils]: 157: Hoare triple {127507#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 158: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 159: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 160: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 161: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 162: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 163: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 164: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,953 INFO L290 TraceCheckUtils]: 165: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 166: Hoare triple {127507#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 167: Hoare triple {127507#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 168: Hoare triple {127507#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 169: Hoare triple {127507#false} assume 4416 == #t~mem60;havoc #t~mem60; {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 170: Hoare triple {127507#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 171: Hoare triple {127507#false} assume !(3 == ~blastFlag~0); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 172: Hoare triple {127507#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); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 173: Hoare triple {127507#false} assume !(0 == ~tmp___6~0); {127507#false} is VALID [2022-04-28 15:21:25,954 INFO L290 TraceCheckUtils]: 174: Hoare triple {127507#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 175: Hoare triple {127507#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 176: Hoare triple {127507#false} ~skip~0 := 0; {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 177: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 178: Hoare triple {127507#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 179: Hoare triple {127507#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 180: Hoare triple {127507#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 181: Hoare triple {127507#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,955 INFO L290 TraceCheckUtils]: 182: Hoare triple {127507#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 183: Hoare triple {127507#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 184: Hoare triple {127507#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 185: Hoare triple {127507#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 186: Hoare triple {127507#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 187: Hoare triple {127507#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 188: Hoare triple {127507#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 189: Hoare triple {127507#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,956 INFO L290 TraceCheckUtils]: 190: Hoare triple {127507#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,957 INFO L290 TraceCheckUtils]: 191: Hoare triple {127507#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {127507#false} is VALID [2022-04-28 15:21:25,957 INFO L290 TraceCheckUtils]: 192: Hoare triple {127507#false} assume 4432 == #t~mem62;havoc #t~mem62; {127507#false} is VALID [2022-04-28 15:21:25,957 INFO L290 TraceCheckUtils]: 193: Hoare triple {127507#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {127507#false} is VALID [2022-04-28 15:21:25,957 INFO L290 TraceCheckUtils]: 194: Hoare triple {127507#false} assume 5 == ~blastFlag~0; {127507#false} is VALID [2022-04-28 15:21:25,957 INFO L290 TraceCheckUtils]: 195: Hoare triple {127507#false} assume !false; {127507#false} is VALID [2022-04-28 15:21:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-04-28 15:21:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:25,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494075817] [2022-04-28 15:21:25,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494075817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:25,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:25,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:25,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958919873] [2022-04-28 15:21:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958919873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:25,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:25,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848639339] [2022-04-28 15:21:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:25,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 196 [2022-04-28 15:21:25,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:25,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call 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:26,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:26,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:26,040 INFO L87 Difference]: Start difference. First operand 1193 states and 1792 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call 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:28,065 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:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:29,551 INFO L93 Difference]: Finished difference Result 2592 states and 3887 transitions. [2022-04-28 15:21:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 196 [2022-04-28 15:21:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call 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,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-28 15:21:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call 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,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2022-04-28 15:21:29,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 433 transitions. [2022-04-28 15:21:29,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:29,918 INFO L225 Difference]: With dead ends: 2592 [2022-04-28 15:21:29,918 INFO L226 Difference]: Without dead ends: 1415 [2022-04-28 15:21:29,919 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:29,919 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 74 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:29,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 511 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:21:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-04-28 15:21:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1193. [2022-04-28 15:21:30,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:30,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1415 states. Second operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call 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:30,029 INFO L74 IsIncluded]: Start isIncluded. First operand 1415 states. Second operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call 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:30,030 INFO L87 Difference]: Start difference. First operand 1415 states. Second operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call 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:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:30,111 INFO L93 Difference]: Finished difference Result 1415 states and 2110 transitions. [2022-04-28 15:21:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2022-04-28 15:21:30,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:30,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:30,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 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 1415 states. [2022-04-28 15:21:30,116 INFO L87 Difference]: Start difference. First operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 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 1415 states. [2022-04-28 15:21:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:30,196 INFO L93 Difference]: Finished difference Result 1415 states and 2110 transitions. [2022-04-28 15:21:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2022-04-28 15:21:30,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:30,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:30,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:30,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1188 states have (on average 1.5008417508417509) internal successors, (1783), 1188 states have internal predecessors, (1783), 3 states have call successors, (3), 3 states have call 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:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1787 transitions. [2022-04-28 15:21:30,288 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1787 transitions. Word has length 196 [2022-04-28 15:21:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:30,288 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1787 transitions. [2022-04-28 15:21:30,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call 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:30,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1193 states and 1787 transitions. [2022-04-28 15:21:32,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1787 edges. 1787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1787 transitions. [2022-04-28 15:21:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-28 15:21:32,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:32,007 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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] [2022-04-28 15:21:32,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:21:32,007 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2125464036, now seen corresponding path program 1 times [2022-04-28 15:21:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:32,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852676224] [2022-04-28 15:21:45,997 WARN L232 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:21:55,192 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2125464036, now seen corresponding path program 2 times [2022-04-28 15:21:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188815546] [2022-04-28 15:21:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:55,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {137925#(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); {137918#true} is VALID [2022-04-28 15:21:55,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {137918#true} assume true; {137918#true} is VALID [2022-04-28 15:21:55,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137918#true} {137918#true} #593#return; {137918#true} is VALID [2022-04-28 15:21:55,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {137918#true} call ULTIMATE.init(); {137925#(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:55,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {137925#(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); {137918#true} is VALID [2022-04-28 15:21:55,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {137918#true} assume true; {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137918#true} {137918#true} #593#return; {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {137918#true} call #t~ret158 := main(); {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {137918#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; {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L272 TraceCheckUtils]: 6: Hoare triple {137918#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {137918#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {137918#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {137918#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {137918#true} is VALID [2022-04-28 15:21:55,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {137918#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {137918#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {137918#true} assume 12292 == #t~mem49;havoc #t~mem49; {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {137918#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {137918#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {137918#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {137918#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {137918#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {137918#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {137918#true} assume !(0 == ~tmp___4~0); {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {137918#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {137918#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-28 15:21:55,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {137918#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {137918#true} assume 4368 == #t~mem54;havoc #t~mem54; {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {137918#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {137918#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137918#true} is VALID [2022-04-28 15:21:55,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {137918#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {137918#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {137918#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {137918#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {137918#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {137918#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {137918#true} assume 4384 == #t~mem56;havoc #t~mem56; {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {137918#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {137918#true} is VALID [2022-04-28 15:21:55,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {137918#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {137918#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {137918#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {137918#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {137918#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-28 15:21:55,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {137918#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 65: Hoare triple {137918#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {137918#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,422 INFO L290 TraceCheckUtils]: 67: Hoare triple {137918#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {137918#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {137918#true} assume 4400 == #t~mem58;havoc #t~mem58; {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {137918#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 71: Hoare triple {137918#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {137918#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 73: Hoare triple {137918#true} assume !(~ret~0 <= 0); {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 74: Hoare triple {137918#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,423 INFO L290 TraceCheckUtils]: 75: Hoare triple {137918#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 76: Hoare triple {137918#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {137918#true} ~skip~0 := 0; {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {137918#true} assume !false; {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {137918#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {137918#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {137918#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {137918#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,424 INFO L290 TraceCheckUtils]: 83: Hoare triple {137918#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {137918#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {137918#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 86: Hoare triple {137918#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 87: Hoare triple {137918#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 88: Hoare triple {137918#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 89: Hoare triple {137918#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 90: Hoare triple {137918#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {137918#true} assume 4416 == #t~mem60;havoc #t~mem60; {137918#true} is VALID [2022-04-28 15:21:55,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {137918#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {137918#true} is VALID [2022-04-28 15:21:55,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {137918#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {137918#true} is VALID [2022-04-28 15:21:55,427 INFO L290 TraceCheckUtils]: 94: Hoare triple {137918#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); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,427 INFO L290 TraceCheckUtils]: 95: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,429 INFO L290 TraceCheckUtils]: 98: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,429 INFO L290 TraceCheckUtils]: 99: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,429 INFO L290 TraceCheckUtils]: 100: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,430 INFO L290 TraceCheckUtils]: 101: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,430 INFO L290 TraceCheckUtils]: 102: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,431 INFO L290 TraceCheckUtils]: 103: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,431 INFO L290 TraceCheckUtils]: 104: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,432 INFO L290 TraceCheckUtils]: 105: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,432 INFO L290 TraceCheckUtils]: 106: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,432 INFO L290 TraceCheckUtils]: 107: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,433 INFO L290 TraceCheckUtils]: 108: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,433 INFO L290 TraceCheckUtils]: 109: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,434 INFO L290 TraceCheckUtils]: 110: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,434 INFO L290 TraceCheckUtils]: 111: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,434 INFO L290 TraceCheckUtils]: 112: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,435 INFO L290 TraceCheckUtils]: 113: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,435 INFO L290 TraceCheckUtils]: 114: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,436 INFO L290 TraceCheckUtils]: 115: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,436 INFO L290 TraceCheckUtils]: 116: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,437 INFO L290 TraceCheckUtils]: 117: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,437 INFO L290 TraceCheckUtils]: 118: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,438 INFO L290 TraceCheckUtils]: 119: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,438 INFO L290 TraceCheckUtils]: 120: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,438 INFO L290 TraceCheckUtils]: 121: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,439 INFO L290 TraceCheckUtils]: 122: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,439 INFO L290 TraceCheckUtils]: 123: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,440 INFO L290 TraceCheckUtils]: 124: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:21:55,440 INFO L290 TraceCheckUtils]: 125: Hoare triple {137923#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137924#(not (= |ssl3_connect_#t~mem74| 4512))} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 126: Hoare triple {137924#(not (= |ssl3_connect_#t~mem74| 4512))} assume 4512 == #t~mem74;havoc #t~mem74; {137919#false} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 127: Hoare triple {137919#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {137919#false} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 128: Hoare triple {137919#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~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {137919#false} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 129: Hoare triple {137919#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {137919#false} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 130: Hoare triple {137919#false} assume !(0 == ~tmp___7~0); {137919#false} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 131: Hoare triple {137919#false} assume !(0 == ~tmp___8~0); {137919#false} is VALID [2022-04-28 15:21:55,441 INFO L290 TraceCheckUtils]: 132: Hoare triple {137919#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 133: Hoare triple {137919#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 134: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 135: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 136: Hoare triple {137919#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 137: Hoare triple {137919#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 138: Hoare triple {137919#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 139: Hoare triple {137919#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,442 INFO L290 TraceCheckUtils]: 140: Hoare triple {137919#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 141: Hoare triple {137919#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 142: Hoare triple {137919#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 143: Hoare triple {137919#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 144: Hoare triple {137919#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 145: Hoare triple {137919#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 146: Hoare triple {137919#false} assume 4400 == #t~mem58;havoc #t~mem58; {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 147: Hoare triple {137919#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {137919#false} is VALID [2022-04-28 15:21:55,443 INFO L290 TraceCheckUtils]: 148: Hoare triple {137919#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 149: Hoare triple {137919#false} assume !(2 == ~blastFlag~0); {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 150: Hoare triple {137919#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 151: Hoare triple {137919#false} assume !(~ret~0 <= 0); {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 152: Hoare triple {137919#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 153: Hoare triple {137919#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 154: Hoare triple {137919#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 155: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-28 15:21:55,444 INFO L290 TraceCheckUtils]: 156: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 157: Hoare triple {137919#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 158: Hoare triple {137919#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 159: Hoare triple {137919#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 160: Hoare triple {137919#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 161: Hoare triple {137919#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 162: Hoare triple {137919#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 163: Hoare triple {137919#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 164: Hoare triple {137919#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,445 INFO L290 TraceCheckUtils]: 165: Hoare triple {137919#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 166: Hoare triple {137919#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 167: Hoare triple {137919#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 168: Hoare triple {137919#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 169: Hoare triple {137919#false} assume 4416 == #t~mem60;havoc #t~mem60; {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 170: Hoare triple {137919#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 171: Hoare triple {137919#false} assume !(3 == ~blastFlag~0); {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 172: Hoare triple {137919#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); {137919#false} is VALID [2022-04-28 15:21:55,446 INFO L290 TraceCheckUtils]: 173: Hoare triple {137919#false} assume !(0 == ~tmp___6~0); {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 174: Hoare triple {137919#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 175: Hoare triple {137919#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 176: Hoare triple {137919#false} ~skip~0 := 0; {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 177: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 178: Hoare triple {137919#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 179: Hoare triple {137919#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 180: Hoare triple {137919#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,447 INFO L290 TraceCheckUtils]: 181: Hoare triple {137919#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 182: Hoare triple {137919#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 183: Hoare triple {137919#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 184: Hoare triple {137919#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 185: Hoare triple {137919#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 186: Hoare triple {137919#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 187: Hoare triple {137919#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 188: Hoare triple {137919#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,448 INFO L290 TraceCheckUtils]: 189: Hoare triple {137919#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,449 INFO L290 TraceCheckUtils]: 190: Hoare triple {137919#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,449 INFO L290 TraceCheckUtils]: 191: Hoare triple {137919#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137919#false} is VALID [2022-04-28 15:21:55,449 INFO L290 TraceCheckUtils]: 192: Hoare triple {137919#false} assume 4432 == #t~mem62;havoc #t~mem62; {137919#false} is VALID [2022-04-28 15:21:55,449 INFO L290 TraceCheckUtils]: 193: Hoare triple {137919#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {137919#false} is VALID [2022-04-28 15:21:55,449 INFO L290 TraceCheckUtils]: 194: Hoare triple {137919#false} assume 5 == ~blastFlag~0; {137919#false} is VALID [2022-04-28 15:21:55,449 INFO L290 TraceCheckUtils]: 195: Hoare triple {137919#false} assume !false; {137919#false} is VALID [2022-04-28 15:21:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-28 15:21:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:55,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188815546] [2022-04-28 15:21:55,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188815546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:55,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:55,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:55,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852676224] [2022-04-28 15:21:55,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852676224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:55,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:55,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547048373] [2022-04-28 15:21:55,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:55,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 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 196 [2022-04-28 15:21:55,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:55,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call 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:55,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:55,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:55,557 INFO L87 Difference]: Start difference. First operand 1193 states and 1787 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call 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:57,584 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:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:59,007 INFO L93 Difference]: Finished difference Result 2909 states and 4318 transitions. [2022-04-28 15:21:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:59,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 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 196 [2022-04-28 15:21:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call 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:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:21:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call 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:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-28 15:21:59,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-28 15:21:59,348 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:21:59,479 INFO L225 Difference]: With dead ends: 2909 [2022-04-28 15:21:59,479 INFO L226 Difference]: Without dead ends: 1732 [2022-04-28 15:21:59,481 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:59,481 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 93 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:59,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 282 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:21:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-04-28 15:21:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1421. [2022-04-28 15:21:59,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:59,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1732 states. Second operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call 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:59,595 INFO L74 IsIncluded]: Start isIncluded. First operand 1732 states. Second operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call 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:59,596 INFO L87 Difference]: Start difference. First operand 1732 states. Second operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call 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:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:59,678 INFO L93 Difference]: Finished difference Result 1732 states and 2545 transitions. [2022-04-28 15:21:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2545 transitions. [2022-04-28 15:21:59,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:59,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:59,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 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 1732 states. [2022-04-28 15:21:59,683 INFO L87 Difference]: Start difference. First operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 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 1732 states. [2022-04-28 15:21:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:59,761 INFO L93 Difference]: Finished difference Result 1732 states and 2545 transitions. [2022-04-28 15:21:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2545 transitions. [2022-04-28 15:21:59,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:59,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:59,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:59,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1416 states have (on average 1.5176553672316384) internal successors, (2149), 1416 states have internal predecessors, (2149), 3 states have call successors, (3), 3 states have call 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:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2153 transitions. [2022-04-28 15:21:59,838 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2153 transitions. Word has length 196 [2022-04-28 15:21:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:59,839 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 2153 transitions. [2022-04-28 15:21:59,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (3), 2 states have call 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:59,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1421 states and 2153 transitions. [2022-04-28 15:22:01,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2153 edges. 2153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2153 transitions. [2022-04-28 15:22:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-28 15:22:01,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:01,980 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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] [2022-04-28 15:22:01,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:22:01,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1893395013, now seen corresponding path program 1 times [2022-04-28 15:22:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:01,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048533755] [2022-04-28 15:22:32,469 WARN L232 SmtUtils]: Spent 23.95s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:22:45,808 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1893395013, now seen corresponding path program 2 times [2022-04-28 15:22:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:45,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767344248] [2022-04-28 15:22:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:45,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:46,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:46,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {150061#(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); {150054#true} is VALID [2022-04-28 15:22:46,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {150054#true} assume true; {150054#true} is VALID [2022-04-28 15:22:46,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150054#true} {150054#true} #593#return; {150054#true} is VALID [2022-04-28 15:22:46,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {150054#true} call ULTIMATE.init(); {150061#(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:46,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {150061#(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); {150054#true} is VALID [2022-04-28 15:22:46,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {150054#true} assume true; {150054#true} is VALID [2022-04-28 15:22:46,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150054#true} {150054#true} #593#return; {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {150054#true} call #t~ret158 := main(); {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {150054#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; {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {150054#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {150054#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {150054#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {150054#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {150054#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {150054#true} is VALID [2022-04-28 15:22:46,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {150054#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {150054#true} assume 12292 == #t~mem49;havoc #t~mem49; {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {150054#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {150054#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {150054#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {150054#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {150054#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {150054#true} is VALID [2022-04-28 15:22:46,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {150054#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {150054#true} assume !(0 == ~tmp___4~0); {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {150054#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {150054#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {150054#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {150054#true} assume 4368 == #t~mem54;havoc #t~mem54; {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {150054#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {150054#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {150054#true} is VALID [2022-04-28 15:22:46,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {150054#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {150054#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {150054#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {150054#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {150054#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {150054#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {150054#true} assume 4384 == #t~mem56;havoc #t~mem56; {150054#true} is VALID [2022-04-28 15:22:46,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {150054#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {150054#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {150054#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {150054#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {150054#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {150054#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-28 15:22:46,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {150054#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {150054#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {150054#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {150054#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {150054#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {150054#true} assume 4400 == #t~mem58;havoc #t~mem58; {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {150054#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {150054#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {150054#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {150054#true} is VALID [2022-04-28 15:22:46,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {150054#true} assume !(~ret~0 <= 0); {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {150054#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {150054#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {150054#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {150054#true} ~skip~0 := 0; {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {150054#true} assume !false; {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {150054#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {150054#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {150054#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {150054#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 83: Hoare triple {150054#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {150054#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {150054#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {150054#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 87: Hoare triple {150054#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {150054#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {150054#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {150054#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150054#true} is VALID [2022-04-28 15:22:46,039 INFO L290 TraceCheckUtils]: 91: Hoare triple {150054#true} assume 4416 == #t~mem60;havoc #t~mem60; {150054#true} is VALID [2022-04-28 15:22:46,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {150054#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150054#true} is VALID [2022-04-28 15:22:46,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {150054#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {150054#true} is VALID [2022-04-28 15:22:46,040 INFO L290 TraceCheckUtils]: 94: Hoare triple {150054#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); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,042 INFO L290 TraceCheckUtils]: 99: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,043 INFO L290 TraceCheckUtils]: 100: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,043 INFO L290 TraceCheckUtils]: 101: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,044 INFO L290 TraceCheckUtils]: 102: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,044 INFO L290 TraceCheckUtils]: 103: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,045 INFO L290 TraceCheckUtils]: 104: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,045 INFO L290 TraceCheckUtils]: 105: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,045 INFO L290 TraceCheckUtils]: 106: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,046 INFO L290 TraceCheckUtils]: 107: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,046 INFO L290 TraceCheckUtils]: 108: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,047 INFO L290 TraceCheckUtils]: 109: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,047 INFO L290 TraceCheckUtils]: 110: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,048 INFO L290 TraceCheckUtils]: 111: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,048 INFO L290 TraceCheckUtils]: 112: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:22:46,048 INFO L290 TraceCheckUtils]: 113: Hoare triple {150059#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {150060#(= |ssl3_connect_#t~mem62| 4432)} is VALID [2022-04-28 15:22:46,049 INFO L290 TraceCheckUtils]: 114: Hoare triple {150060#(= |ssl3_connect_#t~mem62| 4432)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,049 INFO L290 TraceCheckUtils]: 115: Hoare triple {150055#false} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,049 INFO L290 TraceCheckUtils]: 116: Hoare triple {150055#false} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,049 INFO L290 TraceCheckUtils]: 117: Hoare triple {150055#false} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,049 INFO L290 TraceCheckUtils]: 118: Hoare triple {150055#false} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,049 INFO L290 TraceCheckUtils]: 119: Hoare triple {150055#false} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 120: Hoare triple {150055#false} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 121: Hoare triple {150055#false} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 122: Hoare triple {150055#false} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 123: Hoare triple {150055#false} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 124: Hoare triple {150055#false} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 125: Hoare triple {150055#false} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,050 INFO L290 TraceCheckUtils]: 126: Hoare triple {150055#false} assume !(4512 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 127: Hoare triple {150055#false} assume 4513 == #t~mem75;havoc #t~mem75; {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 128: Hoare triple {150055#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 129: Hoare triple {150055#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~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 130: Hoare triple {150055#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 131: Hoare triple {150055#false} assume !(0 == ~tmp___7~0); {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 132: Hoare triple {150055#false} assume !(0 == ~tmp___8~0); {150055#false} is VALID [2022-04-28 15:22:46,051 INFO L290 TraceCheckUtils]: 133: Hoare triple {150055#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 134: Hoare triple {150055#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 135: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 136: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 137: Hoare triple {150055#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 138: Hoare triple {150055#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 139: Hoare triple {150055#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 140: Hoare triple {150055#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 141: Hoare triple {150055#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,052 INFO L290 TraceCheckUtils]: 142: Hoare triple {150055#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 143: Hoare triple {150055#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 144: Hoare triple {150055#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 145: Hoare triple {150055#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 146: Hoare triple {150055#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 147: Hoare triple {150055#false} assume 4400 == #t~mem58;havoc #t~mem58; {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 148: Hoare triple {150055#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {150055#false} is VALID [2022-04-28 15:22:46,053 INFO L290 TraceCheckUtils]: 149: Hoare triple {150055#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 150: Hoare triple {150055#false} assume !(2 == ~blastFlag~0); {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 151: Hoare triple {150055#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 152: Hoare triple {150055#false} assume !(~ret~0 <= 0); {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 153: Hoare triple {150055#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 154: Hoare triple {150055#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 155: Hoare triple {150055#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 156: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-28 15:22:46,054 INFO L290 TraceCheckUtils]: 157: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 158: Hoare triple {150055#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 159: Hoare triple {150055#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 160: Hoare triple {150055#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 161: Hoare triple {150055#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 162: Hoare triple {150055#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 163: Hoare triple {150055#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,055 INFO L290 TraceCheckUtils]: 164: Hoare triple {150055#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 165: Hoare triple {150055#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 166: Hoare triple {150055#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 167: Hoare triple {150055#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 168: Hoare triple {150055#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 169: Hoare triple {150055#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 170: Hoare triple {150055#false} assume 4416 == #t~mem60;havoc #t~mem60; {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 171: Hoare triple {150055#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150055#false} is VALID [2022-04-28 15:22:46,056 INFO L290 TraceCheckUtils]: 172: Hoare triple {150055#false} assume !(3 == ~blastFlag~0); {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 173: Hoare triple {150055#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); {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 174: Hoare triple {150055#false} assume !(0 == ~tmp___6~0); {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 175: Hoare triple {150055#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 176: Hoare triple {150055#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 177: Hoare triple {150055#false} ~skip~0 := 0; {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 178: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 179: Hoare triple {150055#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,057 INFO L290 TraceCheckUtils]: 180: Hoare triple {150055#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 181: Hoare triple {150055#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 182: Hoare triple {150055#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 183: Hoare triple {150055#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 184: Hoare triple {150055#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 185: Hoare triple {150055#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 186: Hoare triple {150055#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 187: Hoare triple {150055#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,058 INFO L290 TraceCheckUtils]: 188: Hoare triple {150055#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 189: Hoare triple {150055#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 190: Hoare triple {150055#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 191: Hoare triple {150055#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 192: Hoare triple {150055#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 193: Hoare triple {150055#false} assume 4432 == #t~mem62;havoc #t~mem62; {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 194: Hoare triple {150055#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 195: Hoare triple {150055#false} assume 5 == ~blastFlag~0; {150055#false} is VALID [2022-04-28 15:22:46,059 INFO L290 TraceCheckUtils]: 196: Hoare triple {150055#false} assume !false; {150055#false} is VALID [2022-04-28 15:22:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-04-28 15:22:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:46,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767344248] [2022-04-28 15:22:46,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767344248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:46,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:46,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:46,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:46,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048533755] [2022-04-28 15:22:46,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048533755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:46,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:46,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488834735] [2022-04-28 15:22:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:46,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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:22:46,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:46,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call 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:46,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:46,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:46,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:46,166 INFO L87 Difference]: Start difference. First operand 1421 states and 2153 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call 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:48,186 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:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:49,478 INFO L93 Difference]: Finished difference Result 2858 states and 4319 transitions. [2022-04-28 15:22:49,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:49,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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:22:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call 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:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-28 15:22:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call 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:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-28 15:22:49,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-04-28 15:22:49,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:49,793 INFO L225 Difference]: With dead ends: 2858 [2022-04-28 15:22:49,793 INFO L226 Difference]: Without dead ends: 1453 [2022-04-28 15:22:49,796 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:22:49,796 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 19 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:49,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 460 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:22:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-04-28 15:22:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1421. [2022-04-28 15:22:49,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:49,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1453 states. Second operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call 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:49,890 INFO L74 IsIncluded]: Start isIncluded. First operand 1453 states. Second operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call 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:49,891 INFO L87 Difference]: Start difference. First operand 1453 states. Second operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call 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:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:49,942 INFO L93 Difference]: Finished difference Result 1453 states and 2181 transitions. [2022-04-28 15:22:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2181 transitions. [2022-04-28 15:22:49,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:49,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:49,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 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 1453 states. [2022-04-28 15:22:49,946 INFO L87 Difference]: Start difference. First operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 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 1453 states. [2022-04-28 15:22:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:49,999 INFO L93 Difference]: Finished difference Result 1453 states and 2181 transitions. [2022-04-28 15:22:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2181 transitions. [2022-04-28 15:22:50,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:50,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:50,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:50,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1416 states have (on average 1.5141242937853108) internal successors, (2144), 1416 states have internal predecessors, (2144), 3 states have call successors, (3), 3 states have call 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:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2148 transitions. [2022-04-28 15:22:50,087 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2148 transitions. Word has length 197 [2022-04-28 15:22:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:50,088 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 2148 transitions. [2022-04-28 15:22:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call 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:50,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1421 states and 2148 transitions. [2022-04-28 15:22:52,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2148 edges. 2148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2148 transitions. [2022-04-28 15:22:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-28 15:22:52,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:52,261 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 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] [2022-04-28 15:22:52,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:22:52,261 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1803608870, now seen corresponding path program 1 times [2022-04-28 15:22:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:52,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879850208] [2022-04-28 15:23:05,278 WARN L232 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:23:13,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1803608870, now seen corresponding path program 2 times [2022-04-28 15:23:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:13,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96758225] [2022-04-28 15:23:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:14,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {161537#(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); {161530#true} is VALID [2022-04-28 15:23:14,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {161530#true} assume true; {161530#true} is VALID [2022-04-28 15:23:14,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161530#true} {161530#true} #593#return; {161530#true} is VALID [2022-04-28 15:23:14,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {161530#true} call ULTIMATE.init(); {161537#(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:14,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {161537#(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); {161530#true} is VALID [2022-04-28 15:23:14,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {161530#true} assume true; {161530#true} is VALID [2022-04-28 15:23:14,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161530#true} {161530#true} #593#return; {161530#true} is VALID [2022-04-28 15:23:14,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {161530#true} call #t~ret158 := main(); {161530#true} is VALID [2022-04-28 15:23:14,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {161530#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; {161530#true} is VALID [2022-04-28 15:23:14,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {161530#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {161530#true} is VALID [2022-04-28 15:23:14,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {161530#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {161530#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {161530#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {161530#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {161530#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {161530#true} assume 12292 == #t~mem49;havoc #t~mem49; {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {161530#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {161530#true} is VALID [2022-04-28 15:23:14,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {161530#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {161530#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {161530#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {161530#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {161530#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {161530#true} assume !(0 == ~tmp___4~0); {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {161530#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {161530#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-28 15:23:14,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {161530#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {161530#true} assume 4368 == #t~mem54;havoc #t~mem54; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {161530#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {161530#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {161530#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {161530#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {161530#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-28 15:23:14,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {161530#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {161530#true} assume 4384 == #t~mem56;havoc #t~mem56; {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {161530#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {161530#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {161530#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {161530#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {161530#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {161530#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-28 15:23:14,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {161530#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,014 INFO L290 TraceCheckUtils]: 66: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {161530#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 68: Hoare triple {161530#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 69: Hoare triple {161530#true} assume 4400 == #t~mem58;havoc #t~mem58; {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 70: Hoare triple {161530#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 71: Hoare triple {161530#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 72: Hoare triple {161530#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 73: Hoare triple {161530#true} assume !(~ret~0 <= 0); {161530#true} is VALID [2022-04-28 15:23:14,015 INFO L290 TraceCheckUtils]: 74: Hoare triple {161530#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 75: Hoare triple {161530#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 76: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 77: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 78: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 79: Hoare triple {161530#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 80: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 81: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,016 INFO L290 TraceCheckUtils]: 82: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 83: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 84: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 85: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 86: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 87: Hoare triple {161530#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 88: Hoare triple {161530#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 89: Hoare triple {161530#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,017 INFO L290 TraceCheckUtils]: 90: Hoare triple {161530#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 91: Hoare triple {161530#true} assume 4416 == #t~mem60;havoc #t~mem60; {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 92: Hoare triple {161530#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 93: Hoare triple {161530#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 94: Hoare triple {161530#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); {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 95: Hoare triple {161530#true} assume !(0 == ~tmp___6~0); {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 96: Hoare triple {161530#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 97: Hoare triple {161530#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161530#true} is VALID [2022-04-28 15:23:14,018 INFO L290 TraceCheckUtils]: 98: Hoare triple {161530#true} ~skip~0 := 0; {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 99: Hoare triple {161530#true} assume !false; {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 100: Hoare triple {161530#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 101: Hoare triple {161530#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 102: Hoare triple {161530#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 103: Hoare triple {161530#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 104: Hoare triple {161530#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 105: Hoare triple {161530#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,019 INFO L290 TraceCheckUtils]: 106: Hoare triple {161530#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 107: Hoare triple {161530#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 108: Hoare triple {161530#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 109: Hoare triple {161530#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 110: Hoare triple {161530#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 111: Hoare triple {161530#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 112: Hoare triple {161530#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 113: Hoare triple {161530#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {161530#true} is VALID [2022-04-28 15:23:14,020 INFO L290 TraceCheckUtils]: 114: Hoare triple {161530#true} assume 4432 == #t~mem62;havoc #t~mem62; {161530#true} is VALID [2022-04-28 15:23:14,021 INFO L290 TraceCheckUtils]: 115: Hoare triple {161530#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {161530#true} is VALID [2022-04-28 15:23:14,021 INFO L290 TraceCheckUtils]: 116: Hoare triple {161530#true} assume !(5 == ~blastFlag~0); {161530#true} is VALID [2022-04-28 15:23:14,022 INFO L290 TraceCheckUtils]: 117: Hoare triple {161530#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); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,023 INFO L290 TraceCheckUtils]: 118: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,023 INFO L290 TraceCheckUtils]: 119: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,023 INFO L290 TraceCheckUtils]: 120: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,024 INFO L290 TraceCheckUtils]: 121: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,024 INFO L290 TraceCheckUtils]: 122: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,025 INFO L290 TraceCheckUtils]: 123: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,025 INFO L290 TraceCheckUtils]: 124: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,025 INFO L290 TraceCheckUtils]: 125: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,026 INFO L290 TraceCheckUtils]: 126: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,026 INFO L290 TraceCheckUtils]: 127: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,026 INFO L290 TraceCheckUtils]: 128: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,027 INFO L290 TraceCheckUtils]: 129: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:23:14,027 INFO L290 TraceCheckUtils]: 130: Hoare triple {161535#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161536#(= |ssl3_connect_#t~mem57| 4448)} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 131: Hoare triple {161536#(= |ssl3_connect_#t~mem57| 4448)} assume 4385 == #t~mem57;havoc #t~mem57; {161531#false} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 132: Hoare triple {161531#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {161531#false} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 133: Hoare triple {161531#false} assume !(1 == ~blastFlag~0); {161531#false} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 134: Hoare triple {161531#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 135: Hoare triple {161531#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 136: Hoare triple {161531#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,028 INFO L290 TraceCheckUtils]: 137: Hoare triple {161531#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 138: Hoare triple {161531#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 139: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 140: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 141: Hoare triple {161531#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 142: Hoare triple {161531#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 143: Hoare triple {161531#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,050 INFO L290 TraceCheckUtils]: 144: Hoare triple {161531#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 145: Hoare triple {161531#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 146: Hoare triple {161531#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 147: Hoare triple {161531#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 148: Hoare triple {161531#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 149: Hoare triple {161531#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 150: Hoare triple {161531#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,051 INFO L290 TraceCheckUtils]: 151: Hoare triple {161531#false} assume 4400 == #t~mem58;havoc #t~mem58; {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 152: Hoare triple {161531#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 153: Hoare triple {161531#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 154: Hoare triple {161531#false} assume !(2 == ~blastFlag~0); {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 155: Hoare triple {161531#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 156: Hoare triple {161531#false} assume !(~ret~0 <= 0); {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 157: Hoare triple {161531#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,052 INFO L290 TraceCheckUtils]: 158: Hoare triple {161531#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,053 INFO L290 TraceCheckUtils]: 159: Hoare triple {161531#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161531#false} is VALID [2022-04-28 15:23:14,053 INFO L290 TraceCheckUtils]: 160: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-28 15:23:14,053 INFO L290 TraceCheckUtils]: 161: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-28 15:23:14,053 INFO L290 TraceCheckUtils]: 162: Hoare triple {161531#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,053 INFO L290 TraceCheckUtils]: 163: Hoare triple {161531#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,061 INFO L290 TraceCheckUtils]: 164: Hoare triple {161531#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,061 INFO L290 TraceCheckUtils]: 165: Hoare triple {161531#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,061 INFO L290 TraceCheckUtils]: 166: Hoare triple {161531#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,061 INFO L290 TraceCheckUtils]: 167: Hoare triple {161531#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,061 INFO L290 TraceCheckUtils]: 168: Hoare triple {161531#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 169: Hoare triple {161531#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 170: Hoare triple {161531#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 171: Hoare triple {161531#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 172: Hoare triple {161531#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 173: Hoare triple {161531#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 174: Hoare triple {161531#false} assume 4416 == #t~mem60;havoc #t~mem60; {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 175: Hoare triple {161531#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {161531#false} is VALID [2022-04-28 15:23:14,062 INFO L290 TraceCheckUtils]: 176: Hoare triple {161531#false} assume !(3 == ~blastFlag~0); {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 177: Hoare triple {161531#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); {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 178: Hoare triple {161531#false} assume !(0 == ~tmp___6~0); {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 179: Hoare triple {161531#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 180: Hoare triple {161531#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 181: Hoare triple {161531#false} ~skip~0 := 0; {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 182: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 183: Hoare triple {161531#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,063 INFO L290 TraceCheckUtils]: 184: Hoare triple {161531#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 185: Hoare triple {161531#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 186: Hoare triple {161531#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 187: Hoare triple {161531#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 188: Hoare triple {161531#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 189: Hoare triple {161531#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 190: Hoare triple {161531#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 191: Hoare triple {161531#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,064 INFO L290 TraceCheckUtils]: 192: Hoare triple {161531#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 193: Hoare triple {161531#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 194: Hoare triple {161531#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 195: Hoare triple {161531#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 196: Hoare triple {161531#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 197: Hoare triple {161531#false} assume 4432 == #t~mem62;havoc #t~mem62; {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 198: Hoare triple {161531#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 199: Hoare triple {161531#false} assume 5 == ~blastFlag~0; {161531#false} is VALID [2022-04-28 15:23:14,065 INFO L290 TraceCheckUtils]: 200: Hoare triple {161531#false} assume !false; {161531#false} is VALID [2022-04-28 15:23:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-04-28 15:23:14,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96758225] [2022-04-28 15:23:14,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96758225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:14,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:14,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:14,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:14,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879850208] [2022-04-28 15:23:14,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879850208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:14,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:14,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134937345] [2022-04-28 15:23:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:14,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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:23:14,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:14,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call 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:14,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:14,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:14,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:14,157 INFO L87 Difference]: Start difference. First operand 1421 states and 2148 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call 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:16,177 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:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:18,034 INFO L93 Difference]: Finished difference Result 3286 states and 4942 transitions. [2022-04-28 15:23:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:18,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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:23:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call 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:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-28 15:23:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call 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:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-28 15:23:18,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-28 15:23:18,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:18,495 INFO L225 Difference]: With dead ends: 3286 [2022-04-28 15:23:18,495 INFO L226 Difference]: Without dead ends: 1881 [2022-04-28 15:23:18,497 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:23:18,497 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 78 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:18,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 538 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:23:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-04-28 15:23:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1535. [2022-04-28 15:23:18,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:18,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1881 states. Second operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call 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:18,619 INFO L74 IsIncluded]: Start isIncluded. First operand 1881 states. Second operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call 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:18,620 INFO L87 Difference]: Start difference. First operand 1881 states. Second operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call 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:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:18,719 INFO L93 Difference]: Finished difference Result 1881 states and 2808 transitions. [2022-04-28 15:23:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2808 transitions. [2022-04-28 15:23:18,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:18,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:18,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 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 1881 states. [2022-04-28 15:23:18,723 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 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 1881 states. [2022-04-28 15:23:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:18,819 INFO L93 Difference]: Finished difference Result 1881 states and 2808 transitions. [2022-04-28 15:23:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2808 transitions. [2022-04-28 15:23:18,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:18,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:18,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:18,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.515032679738562) internal successors, (2318), 1530 states have internal predecessors, (2318), 3 states have call successors, (3), 3 states have call 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:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2322 transitions. [2022-04-28 15:23:18,930 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2322 transitions. Word has length 201 [2022-04-28 15:23:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:18,931 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 2322 transitions. [2022-04-28 15:23:18,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call 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:18,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2322 transitions. [2022-04-28 15:23:21,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2322 edges. 2322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2322 transitions. [2022-04-28 15:23:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-28 15:23:21,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:21,314 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:23:21,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:23:21,314 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 255429711, now seen corresponding path program 1 times [2022-04-28 15:23:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:21,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059316528] [2022-04-28 15:23:40,523 WARN L232 SmtUtils]: Spent 12.52s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:23:50,731 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 255429711, now seen corresponding path program 2 times [2022-04-28 15:23:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692593661] [2022-04-28 15:23:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:50,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {174953#(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); {174946#true} is VALID [2022-04-28 15:23:50,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {174946#true} assume true; {174946#true} is VALID [2022-04-28 15:23:50,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174946#true} {174946#true} #593#return; {174946#true} is VALID [2022-04-28 15:23:50,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {174946#true} call ULTIMATE.init(); {174953#(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:50,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {174953#(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); {174946#true} is VALID [2022-04-28 15:23:50,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {174946#true} assume true; {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174946#true} {174946#true} #593#return; {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {174946#true} call #t~ret158 := main(); {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {174946#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; {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {174946#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {174946#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {174946#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {174946#true} is VALID [2022-04-28 15:23:50,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {174946#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {174946#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {174946#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {174946#true} assume 12292 == #t~mem49;havoc #t~mem49; {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {174946#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {174946#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {174946#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {174946#true} is VALID [2022-04-28 15:23:50,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {174946#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {174946#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {174946#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {174946#true} assume !(0 == ~tmp___4~0); {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {174946#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {174946#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-28 15:23:50,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {174946#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {174946#true} assume 4368 == #t~mem54;havoc #t~mem54; {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {174946#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {174946#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {174946#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {174946#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {174946#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-28 15:23:50,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {174946#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {174946#true} assume 4384 == #t~mem56;havoc #t~mem56; {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {174946#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {174946#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {174946#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {174946#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {174946#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {174946#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-28 15:23:50,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 59: Hoare triple {174946#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 61: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 62: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {174946#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {174946#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {174946#true} assume 4400 == #t~mem58;havoc #t~mem58; {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {174946#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {174946#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {174946#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {174946#true} is VALID [2022-04-28 15:23:50,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {174946#true} assume !(~ret~0 <= 0); {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {174946#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {174946#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 78: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {174946#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 82: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 83: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 84: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 85: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 86: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 87: Hoare triple {174946#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 88: Hoare triple {174946#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 89: Hoare triple {174946#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,990 INFO L290 TraceCheckUtils]: 90: Hoare triple {174946#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 91: Hoare triple {174946#true} assume 4416 == #t~mem60;havoc #t~mem60; {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 92: Hoare triple {174946#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {174946#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 94: Hoare triple {174946#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); {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 95: Hoare triple {174946#true} assume !(0 == ~tmp___6~0); {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 96: Hoare triple {174946#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 97: Hoare triple {174946#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174946#true} is VALID [2022-04-28 15:23:50,991 INFO L290 TraceCheckUtils]: 98: Hoare triple {174946#true} ~skip~0 := 0; {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 99: Hoare triple {174946#true} assume !false; {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {174946#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {174946#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 102: Hoare triple {174946#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {174946#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 104: Hoare triple {174946#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 105: Hoare triple {174946#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,992 INFO L290 TraceCheckUtils]: 106: Hoare triple {174946#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 107: Hoare triple {174946#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 108: Hoare triple {174946#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 109: Hoare triple {174946#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 110: Hoare triple {174946#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 111: Hoare triple {174946#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 112: Hoare triple {174946#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 113: Hoare triple {174946#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {174946#true} assume 4432 == #t~mem62;havoc #t~mem62; {174946#true} is VALID [2022-04-28 15:23:50,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {174946#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {174946#true} is VALID [2022-04-28 15:23:50,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {174946#true} assume !(5 == ~blastFlag~0); {174946#true} is VALID [2022-04-28 15:23:50,995 INFO L290 TraceCheckUtils]: 117: Hoare triple {174946#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); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,995 INFO L290 TraceCheckUtils]: 118: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,996 INFO L290 TraceCheckUtils]: 119: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,996 INFO L290 TraceCheckUtils]: 120: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} ~skip~0 := 0; {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,996 INFO L290 TraceCheckUtils]: 121: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !false; {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,997 INFO L290 TraceCheckUtils]: 122: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,997 INFO L290 TraceCheckUtils]: 123: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,997 INFO L290 TraceCheckUtils]: 124: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,998 INFO L290 TraceCheckUtils]: 125: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,998 INFO L290 TraceCheckUtils]: 126: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} is VALID [2022-04-28 15:23:50,998 INFO L290 TraceCheckUtils]: 127: Hoare triple {174951#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4368))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174952#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-28 15:23:50,999 INFO L290 TraceCheckUtils]: 128: Hoare triple {174952#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {174947#false} is VALID [2022-04-28 15:23:50,999 INFO L290 TraceCheckUtils]: 129: Hoare triple {174947#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {174947#false} is VALID [2022-04-28 15:23:50,999 INFO L290 TraceCheckUtils]: 130: Hoare triple {174947#false} assume !(0 == ~blastFlag~0); {174947#false} is VALID [2022-04-28 15:23:50,999 INFO L290 TraceCheckUtils]: 131: Hoare triple {174947#false} 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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {174947#false} is VALID [2022-04-28 15:23:50,999 INFO L290 TraceCheckUtils]: 132: Hoare triple {174947#false} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {174947#false} is VALID [2022-04-28 15:23:50,999 INFO L290 TraceCheckUtils]: 133: Hoare triple {174947#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 134: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 135: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 136: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 137: Hoare triple {174947#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 138: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 139: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,000 INFO L290 TraceCheckUtils]: 140: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 141: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 142: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 143: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 144: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 145: Hoare triple {174947#false} assume 4384 == #t~mem56;havoc #t~mem56; {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 146: Hoare triple {174947#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 147: Hoare triple {174947#false} assume !(1 == ~blastFlag~0); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 148: Hoare triple {174947#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,001 INFO L290 TraceCheckUtils]: 149: Hoare triple {174947#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 150: Hoare triple {174947#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 151: Hoare triple {174947#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 152: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 153: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 154: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 155: Hoare triple {174947#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 156: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,002 INFO L290 TraceCheckUtils]: 157: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 158: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 159: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 160: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 161: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 162: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 163: Hoare triple {174947#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 164: Hoare triple {174947#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,003 INFO L290 TraceCheckUtils]: 165: Hoare triple {174947#false} assume 4400 == #t~mem58;havoc #t~mem58; {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 166: Hoare triple {174947#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 167: Hoare triple {174947#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 168: Hoare triple {174947#false} assume !(2 == ~blastFlag~0); {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 169: Hoare triple {174947#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 170: Hoare triple {174947#false} assume !(~ret~0 <= 0); {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 171: Hoare triple {174947#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 172: Hoare triple {174947#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,004 INFO L290 TraceCheckUtils]: 173: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 174: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 175: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 176: Hoare triple {174947#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 177: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 178: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 179: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 180: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,005 INFO L290 TraceCheckUtils]: 181: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 182: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 183: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 184: Hoare triple {174947#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 185: Hoare triple {174947#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 186: Hoare triple {174947#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 187: Hoare triple {174947#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 188: Hoare triple {174947#false} assume 4416 == #t~mem60;havoc #t~mem60; {174947#false} is VALID [2022-04-28 15:23:51,006 INFO L290 TraceCheckUtils]: 189: Hoare triple {174947#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 190: Hoare triple {174947#false} assume !(3 == ~blastFlag~0); {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 191: Hoare triple {174947#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); {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 192: Hoare triple {174947#false} assume !(0 == ~tmp___6~0); {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 193: Hoare triple {174947#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 194: Hoare triple {174947#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 195: Hoare triple {174947#false} ~skip~0 := 0; {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 196: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-28 15:23:51,007 INFO L290 TraceCheckUtils]: 197: Hoare triple {174947#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 198: Hoare triple {174947#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 199: Hoare triple {174947#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 200: Hoare triple {174947#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 201: Hoare triple {174947#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 202: Hoare triple {174947#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 203: Hoare triple {174947#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 204: Hoare triple {174947#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,008 INFO L290 TraceCheckUtils]: 205: Hoare triple {174947#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 206: Hoare triple {174947#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 207: Hoare triple {174947#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 208: Hoare triple {174947#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 209: Hoare triple {174947#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 210: Hoare triple {174947#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 211: Hoare triple {174947#false} assume 4432 == #t~mem62;havoc #t~mem62; {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 212: Hoare triple {174947#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {174947#false} is VALID [2022-04-28 15:23:51,009 INFO L290 TraceCheckUtils]: 213: Hoare triple {174947#false} assume 5 == ~blastFlag~0; {174947#false} is VALID [2022-04-28 15:23:51,010 INFO L290 TraceCheckUtils]: 214: Hoare triple {174947#false} assume !false; {174947#false} is VALID [2022-04-28 15:23:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-28 15:23:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:51,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692593661] [2022-04-28 15:23:51,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692593661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:51,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:51,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:51,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:51,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059316528] [2022-04-28 15:23:51,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059316528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:51,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:51,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867411976] [2022-04-28 15:23:51,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:51,012 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 215 [2022-04-28 15:23:51,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:51,013 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:23:51,115 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:23:51,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:51,116 INFO L87 Difference]: Start difference. First operand 1535 states and 2322 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:23:53,145 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:23:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:54,928 INFO L93 Difference]: Finished difference Result 3285 states and 4956 transitions. [2022-04-28 15:23:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:54,931 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 215 [2022-04-28 15:23:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:54,931 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:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-28 15:23:54,934 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:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-28 15:23:54,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-28 15:23:55,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:55,426 INFO L225 Difference]: With dead ends: 3285 [2022-04-28 15:23:55,427 INFO L226 Difference]: Without dead ends: 2009 [2022-04-28 15:23:55,428 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:23:55,429 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 111 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:55,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 478 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:23:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2022-04-28 15:23:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1535. [2022-04-28 15:23:55,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:55,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2009 states. Second operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call 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:55,536 INFO L74 IsIncluded]: Start isIncluded. First operand 2009 states. Second operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call 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:55,537 INFO L87 Difference]: Start difference. First operand 2009 states. Second operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call 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:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:55,646 INFO L93 Difference]: Finished difference Result 2009 states and 2992 transitions. [2022-04-28 15:23:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2992 transitions. [2022-04-28 15:23:55,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:55,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:55,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 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 2009 states. [2022-04-28 15:23:55,650 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 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 2009 states. [2022-04-28 15:23:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:55,752 INFO L93 Difference]: Finished difference Result 2009 states and 2992 transitions. [2022-04-28 15:23:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2992 transitions. [2022-04-28 15:23:55,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:55,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:55,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:55,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.4967320261437909) internal successors, (2290), 1530 states have internal predecessors, (2290), 3 states have call successors, (3), 3 states have call 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:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2294 transitions. [2022-04-28 15:23:55,843 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2294 transitions. Word has length 215 [2022-04-28 15:23:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:55,843 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 2294 transitions. [2022-04-28 15:23:55,843 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:55,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2294 transitions. [2022-04-28 15:23:58,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2294 edges. 2294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2294 transitions. [2022-04-28 15:23:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-28 15:23:58,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:58,192 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:23:58,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:23:58,193 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 69910624, now seen corresponding path program 1 times [2022-04-28 15:23:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065108289] [2022-04-28 15:24:11,761 WARN L232 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:24:19,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 69910624, now seen corresponding path program 2 times [2022-04-28 15:24:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:19,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166398254] [2022-04-28 15:24:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:20,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {188623#(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); {188616#true} is VALID [2022-04-28 15:24:20,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {188616#true} assume true; {188616#true} is VALID [2022-04-28 15:24:20,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188616#true} {188616#true} #593#return; {188616#true} is VALID [2022-04-28 15:24:20,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {188616#true} call ULTIMATE.init(); {188623#(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:20,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {188623#(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); {188616#true} is VALID [2022-04-28 15:24:20,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {188616#true} assume true; {188616#true} is VALID [2022-04-28 15:24:20,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188616#true} {188616#true} #593#return; {188616#true} is VALID [2022-04-28 15:24:20,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {188616#true} call #t~ret158 := main(); {188616#true} is VALID [2022-04-28 15:24:20,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {188616#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; {188616#true} is VALID [2022-04-28 15:24:20,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {188616#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {188616#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {188616#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {188616#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {188616#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {188616#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {188616#true} assume 12292 == #t~mem49;havoc #t~mem49; {188616#true} is VALID [2022-04-28 15:24:20,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {188616#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {188616#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {188616#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {188616#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {188616#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {188616#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {188616#true} assume !(0 == ~tmp___4~0); {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {188616#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {188616#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {188616#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {188616#true} assume 4368 == #t~mem54;havoc #t~mem54; {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {188616#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {188616#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {188616#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {188616#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {188616#true} is VALID [2022-04-28 15:24:20,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {188616#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {188616#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {188616#true} assume 4384 == #t~mem56;havoc #t~mem56; {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {188616#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {188616#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {188616#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {188616#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {188616#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {188616#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {188616#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {188616#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 68: Hoare triple {188616#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,107 INFO L290 TraceCheckUtils]: 69: Hoare triple {188616#true} assume 4400 == #t~mem58;havoc #t~mem58; {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {188616#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {188616#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {188616#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {188616#true} assume !(~ret~0 <= 0); {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {188616#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {188616#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-28 15:24:20,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {188616#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 86: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {188616#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {188616#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {188616#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {188616#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {188616#true} assume 4416 == #t~mem60;havoc #t~mem60; {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {188616#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {188616#true} is VALID [2022-04-28 15:24:20,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {188616#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 94: Hoare triple {188616#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); {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 95: Hoare triple {188616#true} assume !(0 == ~tmp___6~0); {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 96: Hoare triple {188616#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 97: Hoare triple {188616#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 98: Hoare triple {188616#true} ~skip~0 := 0; {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 99: Hoare triple {188616#true} assume !false; {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 100: Hoare triple {188616#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,111 INFO L290 TraceCheckUtils]: 101: Hoare triple {188616#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 102: Hoare triple {188616#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 103: Hoare triple {188616#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 104: Hoare triple {188616#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 105: Hoare triple {188616#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 106: Hoare triple {188616#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 107: Hoare triple {188616#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 108: Hoare triple {188616#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,112 INFO L290 TraceCheckUtils]: 109: Hoare triple {188616#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {188616#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 111: Hoare triple {188616#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 112: Hoare triple {188616#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 113: Hoare triple {188616#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 114: Hoare triple {188616#true} assume 4432 == #t~mem62;havoc #t~mem62; {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 115: Hoare triple {188616#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {188616#true} is VALID [2022-04-28 15:24:20,113 INFO L290 TraceCheckUtils]: 116: Hoare triple {188616#true} assume !(5 == ~blastFlag~0); {188616#true} is VALID [2022-04-28 15:24:20,114 INFO L290 TraceCheckUtils]: 117: Hoare triple {188616#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); {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:20,115 INFO L290 TraceCheckUtils]: 118: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:20,115 INFO L290 TraceCheckUtils]: 119: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:20,115 INFO L290 TraceCheckUtils]: 120: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:20,116 INFO L290 TraceCheckUtils]: 121: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:20,116 INFO L290 TraceCheckUtils]: 122: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:20,117 INFO L290 TraceCheckUtils]: 123: Hoare triple {188621#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188622#(= |ssl3_connect_#t~mem50| 4448)} is VALID [2022-04-28 15:24:20,117 INFO L290 TraceCheckUtils]: 124: Hoare triple {188622#(= |ssl3_connect_#t~mem50| 4448)} assume 16384 == #t~mem50;havoc #t~mem50; {188617#false} is VALID [2022-04-28 15:24:20,117 INFO L290 TraceCheckUtils]: 125: Hoare triple {188617#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,117 INFO L290 TraceCheckUtils]: 126: Hoare triple {188617#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {188617#false} is VALID [2022-04-28 15:24:20,117 INFO L290 TraceCheckUtils]: 127: Hoare triple {188617#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 128: Hoare triple {188617#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 129: Hoare triple {188617#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 130: Hoare triple {188617#false} assume !(0 == ~tmp___4~0); {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 131: Hoare triple {188617#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 132: Hoare triple {188617#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 133: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 134: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 135: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-28 15:24:20,118 INFO L290 TraceCheckUtils]: 136: Hoare triple {188617#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 137: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 138: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 139: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 140: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 141: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 142: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 143: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,119 INFO L290 TraceCheckUtils]: 144: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 145: Hoare triple {188617#false} assume 4385 == #t~mem57;havoc #t~mem57; {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 146: Hoare triple {188617#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 147: Hoare triple {188617#false} assume !(1 == ~blastFlag~0); {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 148: Hoare triple {188617#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 149: Hoare triple {188617#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 150: Hoare triple {188617#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 151: Hoare triple {188617#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,120 INFO L290 TraceCheckUtils]: 152: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 153: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 154: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 155: Hoare triple {188617#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 156: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 157: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 158: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 159: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,121 INFO L290 TraceCheckUtils]: 160: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 161: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 162: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 163: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 164: Hoare triple {188617#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 165: Hoare triple {188617#false} assume 4400 == #t~mem58;havoc #t~mem58; {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 166: Hoare triple {188617#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 167: Hoare triple {188617#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 168: Hoare triple {188617#false} assume !(2 == ~blastFlag~0); {188617#false} is VALID [2022-04-28 15:24:20,122 INFO L290 TraceCheckUtils]: 169: Hoare triple {188617#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 170: Hoare triple {188617#false} assume !(~ret~0 <= 0); {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 171: Hoare triple {188617#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 172: Hoare triple {188617#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 173: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 174: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 175: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 176: Hoare triple {188617#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,123 INFO L290 TraceCheckUtils]: 177: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 178: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 179: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 180: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 181: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 182: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 183: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 184: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,124 INFO L290 TraceCheckUtils]: 185: Hoare triple {188617#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 186: Hoare triple {188617#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 187: Hoare triple {188617#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 188: Hoare triple {188617#false} assume 4416 == #t~mem60;havoc #t~mem60; {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 189: Hoare triple {188617#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 190: Hoare triple {188617#false} assume !(3 == ~blastFlag~0); {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 191: Hoare triple {188617#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); {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 192: Hoare triple {188617#false} assume !(0 == ~tmp___6~0); {188617#false} is VALID [2022-04-28 15:24:20,125 INFO L290 TraceCheckUtils]: 193: Hoare triple {188617#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 194: Hoare triple {188617#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 195: Hoare triple {188617#false} ~skip~0 := 0; {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 196: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 197: Hoare triple {188617#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 198: Hoare triple {188617#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 199: Hoare triple {188617#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 200: Hoare triple {188617#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,126 INFO L290 TraceCheckUtils]: 201: Hoare triple {188617#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 202: Hoare triple {188617#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 203: Hoare triple {188617#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 204: Hoare triple {188617#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 205: Hoare triple {188617#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 206: Hoare triple {188617#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 207: Hoare triple {188617#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 208: Hoare triple {188617#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,127 INFO L290 TraceCheckUtils]: 209: Hoare triple {188617#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,128 INFO L290 TraceCheckUtils]: 210: Hoare triple {188617#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {188617#false} is VALID [2022-04-28 15:24:20,128 INFO L290 TraceCheckUtils]: 211: Hoare triple {188617#false} assume 4432 == #t~mem62;havoc #t~mem62; {188617#false} is VALID [2022-04-28 15:24:20,128 INFO L290 TraceCheckUtils]: 212: Hoare triple {188617#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {188617#false} is VALID [2022-04-28 15:24:20,128 INFO L290 TraceCheckUtils]: 213: Hoare triple {188617#false} assume 5 == ~blastFlag~0; {188617#false} is VALID [2022-04-28 15:24:20,128 INFO L290 TraceCheckUtils]: 214: Hoare triple {188617#false} assume !false; {188617#false} is VALID [2022-04-28 15:24:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-28 15:24:20,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:20,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166398254] [2022-04-28 15:24:20,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166398254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:20,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:20,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:20,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:20,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065108289] [2022-04-28 15:24:20,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065108289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:20,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:20,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352699809] [2022-04-28 15:24:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:20,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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 215 [2022-04-28 15:24:20,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:20,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call 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:20,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:20,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:24:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:24:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:24:20,233 INFO L87 Difference]: Start difference. First operand 1535 states and 2294 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call 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:22,252 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:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:24,052 INFO L93 Difference]: Finished difference Result 3383 states and 5036 transitions. [2022-04-28 15:24:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:24:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 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 215 [2022-04-28 15:24:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call 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:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 15:24:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call 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:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 15:24:24,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-28 15:24:24,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:24,494 INFO L225 Difference]: With dead ends: 3383 [2022-04-28 15:24:24,494 INFO L226 Difference]: Without dead ends: 1864 [2022-04-28 15:24:24,496 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:24:24,496 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 81 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:24,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 530 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:24:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-04-28 15:24:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1535. [2022-04-28 15:24:24,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:24,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call 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:24,616 INFO L74 IsIncluded]: Start isIncluded. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call 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:24,617 INFO L87 Difference]: Start difference. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call 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:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:24,704 INFO L93 Difference]: Finished difference Result 1864 states and 2756 transitions. [2022-04-28 15:24:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2756 transitions. [2022-04-28 15:24:24,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:24,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:24,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 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 1864 states. [2022-04-28 15:24:24,708 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 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 1864 states. [2022-04-28 15:24:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:24,801 INFO L93 Difference]: Finished difference Result 1864 states and 2756 transitions. [2022-04-28 15:24:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2756 transitions. [2022-04-28 15:24:24,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:24,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:24,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:24,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.49281045751634) internal successors, (2284), 1530 states have internal predecessors, (2284), 3 states have call successors, (3), 3 states have call 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:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2288 transitions. [2022-04-28 15:24:24,905 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2288 transitions. Word has length 215 [2022-04-28 15:24:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:24,905 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 2288 transitions. [2022-04-28 15:24:24,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call 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:24,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2288 transitions. [2022-04-28 15:24:27,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2288 edges. 2288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2288 transitions. [2022-04-28 15:24:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-04-28 15:24:27,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:27,275 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:24:27,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:24:27,275 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash -231635715, now seen corresponding path program 1 times [2022-04-28 15:24:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:27,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1349982895] [2022-04-28 15:24:35,837 WARN L232 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:24:47,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -231635715, now seen corresponding path program 2 times [2022-04-28 15:24:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:47,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548948718] [2022-04-28 15:24:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:47,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {202199#(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); {202192#true} is VALID [2022-04-28 15:24:47,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {202192#true} assume true; {202192#true} is VALID [2022-04-28 15:24:47,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202192#true} {202192#true} #593#return; {202192#true} is VALID [2022-04-28 15:24:47,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {202192#true} call ULTIMATE.init(); {202199#(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:47,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {202199#(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); {202192#true} is VALID [2022-04-28 15:24:47,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {202192#true} assume true; {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202192#true} {202192#true} #593#return; {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {202192#true} call #t~ret158 := main(); {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {202192#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; {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {202192#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {202192#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {202192#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {202192#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {202192#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {202192#true} is VALID [2022-04-28 15:24:47,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {202192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {202192#true} assume 12292 == #t~mem49;havoc #t~mem49; {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {202192#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {202192#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {202192#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {202192#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {202192#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {202192#true} is VALID [2022-04-28 15:24:47,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {202192#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {202192#true} assume !(0 == ~tmp___4~0); {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {202192#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {202192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-28 15:24:47,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {202192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {202192#true} assume 4368 == #t~mem54;havoc #t~mem54; {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {202192#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {202192#true} is VALID [2022-04-28 15:24:47,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {202192#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {202192#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {202192#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {202192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {202192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {202192#true} assume 4384 == #t~mem56;havoc #t~mem56; {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {202192#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {202192#true} is VALID [2022-04-28 15:24:47,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {202192#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {202192#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {202192#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {202192#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {202192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 56: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-28 15:24:47,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {202192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {202192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {202192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {202192#true} assume 4400 == #t~mem58;havoc #t~mem58; {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {202192#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {202192#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 72: Hoare triple {202192#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 73: Hoare triple {202192#true} assume !(~ret~0 <= 0); {202192#true} is VALID [2022-04-28 15:24:47,800 INFO L290 TraceCheckUtils]: 74: Hoare triple {202192#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {202192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 78: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 79: Hoare triple {202192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 80: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,801 INFO L290 TraceCheckUtils]: 81: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 84: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 85: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 87: Hoare triple {202192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {202192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 89: Hoare triple {202192#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {202192#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 91: Hoare triple {202192#true} assume 4416 == #t~mem60;havoc #t~mem60; {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {202192#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {202192#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 94: Hoare triple {202192#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); {202192#true} is VALID [2022-04-28 15:24:47,803 INFO L290 TraceCheckUtils]: 95: Hoare triple {202192#true} assume !(0 == ~tmp___6~0); {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 96: Hoare triple {202192#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 97: Hoare triple {202192#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 98: Hoare triple {202192#true} ~skip~0 := 0; {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 99: Hoare triple {202192#true} assume !false; {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 100: Hoare triple {202192#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 101: Hoare triple {202192#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 102: Hoare triple {202192#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,804 INFO L290 TraceCheckUtils]: 103: Hoare triple {202192#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 104: Hoare triple {202192#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 105: Hoare triple {202192#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 106: Hoare triple {202192#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 107: Hoare triple {202192#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 108: Hoare triple {202192#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {202192#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {202192#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {202192#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,806 INFO L290 TraceCheckUtils]: 112: Hoare triple {202192#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,806 INFO L290 TraceCheckUtils]: 113: Hoare triple {202192#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {202192#true} is VALID [2022-04-28 15:24:47,806 INFO L290 TraceCheckUtils]: 114: Hoare triple {202192#true} assume 4432 == #t~mem62;havoc #t~mem62; {202192#true} is VALID [2022-04-28 15:24:47,806 INFO L290 TraceCheckUtils]: 115: Hoare triple {202192#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {202192#true} is VALID [2022-04-28 15:24:47,806 INFO L290 TraceCheckUtils]: 116: Hoare triple {202192#true} assume !(5 == ~blastFlag~0); {202192#true} is VALID [2022-04-28 15:24:47,807 INFO L290 TraceCheckUtils]: 117: Hoare triple {202192#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); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,808 INFO L290 TraceCheckUtils]: 118: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,808 INFO L290 TraceCheckUtils]: 119: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,808 INFO L290 TraceCheckUtils]: 120: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,809 INFO L290 TraceCheckUtils]: 121: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,810 INFO L290 TraceCheckUtils]: 122: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,810 INFO L290 TraceCheckUtils]: 123: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:24:47,810 INFO L290 TraceCheckUtils]: 124: Hoare triple {202197#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202198#(= |ssl3_connect_#t~mem51| 4448)} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 125: Hoare triple {202198#(= |ssl3_connect_#t~mem51| 4448)} assume 4096 == #t~mem51;havoc #t~mem51; {202193#false} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 126: Hoare triple {202193#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 127: Hoare triple {202193#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {202193#false} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 128: Hoare triple {202193#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 129: Hoare triple {202193#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {202193#false} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 130: Hoare triple {202193#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {202193#false} is VALID [2022-04-28 15:24:47,811 INFO L290 TraceCheckUtils]: 131: Hoare triple {202193#false} assume !(0 == ~tmp___4~0); {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 132: Hoare triple {202193#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 133: Hoare triple {202193#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 134: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 135: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 136: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 137: Hoare triple {202193#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 138: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,812 INFO L290 TraceCheckUtils]: 139: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 140: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 141: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 142: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 143: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 144: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 145: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 146: Hoare triple {202193#false} assume 4385 == #t~mem57;havoc #t~mem57; {202193#false} is VALID [2022-04-28 15:24:47,813 INFO L290 TraceCheckUtils]: 147: Hoare triple {202193#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 148: Hoare triple {202193#false} assume !(1 == ~blastFlag~0); {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 149: Hoare triple {202193#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 150: Hoare triple {202193#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 151: Hoare triple {202193#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 152: Hoare triple {202193#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 153: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 154: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-28 15:24:47,814 INFO L290 TraceCheckUtils]: 155: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 156: Hoare triple {202193#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 157: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 158: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 159: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 160: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 161: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 162: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,815 INFO L290 TraceCheckUtils]: 163: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 164: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 165: Hoare triple {202193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 166: Hoare triple {202193#false} assume 4400 == #t~mem58;havoc #t~mem58; {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 167: Hoare triple {202193#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 168: Hoare triple {202193#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 169: Hoare triple {202193#false} assume !(2 == ~blastFlag~0); {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 170: Hoare triple {202193#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {202193#false} is VALID [2022-04-28 15:24:47,816 INFO L290 TraceCheckUtils]: 171: Hoare triple {202193#false} assume !(~ret~0 <= 0); {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 172: Hoare triple {202193#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 173: Hoare triple {202193#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 174: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 175: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 176: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 177: Hoare triple {202193#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 178: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,817 INFO L290 TraceCheckUtils]: 179: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 180: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 181: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 182: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 183: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 184: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 185: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 186: Hoare triple {202193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,818 INFO L290 TraceCheckUtils]: 187: Hoare triple {202193#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 188: Hoare triple {202193#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 189: Hoare triple {202193#false} assume 4416 == #t~mem60;havoc #t~mem60; {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 190: Hoare triple {202193#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 191: Hoare triple {202193#false} assume !(3 == ~blastFlag~0); {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 192: Hoare triple {202193#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); {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 193: Hoare triple {202193#false} assume !(0 == ~tmp___6~0); {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 194: Hoare triple {202193#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,819 INFO L290 TraceCheckUtils]: 195: Hoare triple {202193#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 196: Hoare triple {202193#false} ~skip~0 := 0; {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 197: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 198: Hoare triple {202193#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 199: Hoare triple {202193#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 200: Hoare triple {202193#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 201: Hoare triple {202193#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 202: Hoare triple {202193#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 203: Hoare triple {202193#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,820 INFO L290 TraceCheckUtils]: 204: Hoare triple {202193#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 205: Hoare triple {202193#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 206: Hoare triple {202193#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 207: Hoare triple {202193#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 208: Hoare triple {202193#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 209: Hoare triple {202193#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 210: Hoare triple {202193#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 211: Hoare triple {202193#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {202193#false} is VALID [2022-04-28 15:24:47,821 INFO L290 TraceCheckUtils]: 212: Hoare triple {202193#false} assume 4432 == #t~mem62;havoc #t~mem62; {202193#false} is VALID [2022-04-28 15:24:47,822 INFO L290 TraceCheckUtils]: 213: Hoare triple {202193#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {202193#false} is VALID [2022-04-28 15:24:47,822 INFO L290 TraceCheckUtils]: 214: Hoare triple {202193#false} assume 5 == ~blastFlag~0; {202193#false} is VALID [2022-04-28 15:24:47,822 INFO L290 TraceCheckUtils]: 215: Hoare triple {202193#false} assume !false; {202193#false} is VALID [2022-04-28 15:24:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-28 15:24:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548948718] [2022-04-28 15:24:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548948718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:47,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:47,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:47,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1349982895] [2022-04-28 15:24:47,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1349982895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:47,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:47,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391105298] [2022-04-28 15:24:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:47,824 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 216 [2022-04-28 15:24:47,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:47,825 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:24:47,913 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:24:47,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:24:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:24:47,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:24:47,914 INFO L87 Difference]: Start difference. First operand 1535 states and 2288 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:24:49,936 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:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:51,778 INFO L93 Difference]: Finished difference Result 3383 states and 5024 transitions. [2022-04-28 15:24:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:24:51,778 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 216 [2022-04-28 15:24:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:51,779 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:24:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:24:51,780 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:24:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:24:51,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-28 15:24:52,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:52,201 INFO L225 Difference]: With dead ends: 3383 [2022-04-28 15:24:52,202 INFO L226 Difference]: Without dead ends: 1864 [2022-04-28 15:24:52,204 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:24:52,204 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 79 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:52,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 528 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:24:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-04-28 15:24:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1535. [2022-04-28 15:24:52,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:52,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call 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:52,379 INFO L74 IsIncluded]: Start isIncluded. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call 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:52,380 INFO L87 Difference]: Start difference. First operand 1864 states. Second operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call 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:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:52,468 INFO L93 Difference]: Finished difference Result 1864 states and 2750 transitions. [2022-04-28 15:24:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2750 transitions. [2022-04-28 15:24:52,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:52,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:52,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 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 1864 states. [2022-04-28 15:24:52,471 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 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 1864 states. [2022-04-28 15:24:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:52,559 INFO L93 Difference]: Finished difference Result 1864 states and 2750 transitions. [2022-04-28 15:24:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2750 transitions. [2022-04-28 15:24:52,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:52,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:52,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:52,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.488888888888889) internal successors, (2278), 1530 states have internal predecessors, (2278), 3 states have call successors, (3), 3 states have call 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:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2282 transitions. [2022-04-28 15:24:52,658 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2282 transitions. Word has length 216 [2022-04-28 15:24:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:52,658 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 2282 transitions. [2022-04-28 15:24:52,658 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:24:52,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2282 transitions. [2022-04-28 15:24:55,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2282 edges. 2282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2282 transitions. [2022-04-28 15:24:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-04-28 15:24:55,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:55,047 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:24:55,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:24:55,047 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:55,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1546125371, now seen corresponding path program 1 times [2022-04-28 15:24:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:55,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672986165] [2022-04-28 15:25:08,825 WARN L232 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:25:17,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1546125371, now seen corresponding path program 2 times [2022-04-28 15:25:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:17,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49855219] [2022-04-28 15:25:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:18,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:18,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {215775#(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); {215768#true} is VALID [2022-04-28 15:25:18,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {215768#true} assume true; {215768#true} is VALID [2022-04-28 15:25:18,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215768#true} {215768#true} #593#return; {215768#true} is VALID [2022-04-28 15:25:18,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {215768#true} call ULTIMATE.init(); {215775#(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:18,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {215775#(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); {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {215768#true} assume true; {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215768#true} {215768#true} #593#return; {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {215768#true} call #t~ret158 := main(); {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {215768#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; {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {215768#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {215768#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {215768#true} is VALID [2022-04-28 15:25:18,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {215768#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {215768#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {215768#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {215768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {215768#true} assume 12292 == #t~mem49;havoc #t~mem49; {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {215768#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {215768#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {215768#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {215768#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {215768#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {215768#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {215768#true} assume !(0 == ~tmp___4~0); {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {215768#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {215768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-28 15:25:18,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {215768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {215768#true} assume 4368 == #t~mem54;havoc #t~mem54; {215768#true} is VALID [2022-04-28 15:25:18,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {215768#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {215768#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {215768#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {215768#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {215768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-28 15:25:18,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {215768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {215768#true} assume 4384 == #t~mem56;havoc #t~mem56; {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {215768#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {215768#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {215768#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {215768#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {215768#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 55: Hoare triple {215768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 56: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-28 15:25:18,154 INFO L290 TraceCheckUtils]: 57: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 59: Hoare triple {215768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 60: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 61: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {215768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {215768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {215768#true} assume 4400 == #t~mem58;havoc #t~mem58; {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 70: Hoare triple {215768#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 71: Hoare triple {215768#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {215768#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {215768#true} is VALID [2022-04-28 15:25:18,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {215768#true} assume !(~ret~0 <= 0); {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {215768#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {215768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {215768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 81: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 82: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 85: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 86: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,158 INFO L290 TraceCheckUtils]: 87: Hoare triple {215768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 88: Hoare triple {215768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 89: Hoare triple {215768#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 90: Hoare triple {215768#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 91: Hoare triple {215768#true} assume 4416 == #t~mem60;havoc #t~mem60; {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 92: Hoare triple {215768#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {215768#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {215768#true} is VALID [2022-04-28 15:25:18,159 INFO L290 TraceCheckUtils]: 94: Hoare triple {215768#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); {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 95: Hoare triple {215768#true} assume !(0 == ~tmp___6~0); {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 96: Hoare triple {215768#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 97: Hoare triple {215768#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 98: Hoare triple {215768#true} ~skip~0 := 0; {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 99: Hoare triple {215768#true} assume !false; {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 100: Hoare triple {215768#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 101: Hoare triple {215768#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {215768#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,161 INFO L290 TraceCheckUtils]: 103: Hoare triple {215768#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {215768#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,161 INFO L290 TraceCheckUtils]: 105: Hoare triple {215768#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,161 INFO L290 TraceCheckUtils]: 106: Hoare triple {215768#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,161 INFO L290 TraceCheckUtils]: 107: Hoare triple {215768#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,161 INFO L290 TraceCheckUtils]: 108: Hoare triple {215768#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,162 INFO L290 TraceCheckUtils]: 109: Hoare triple {215768#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,162 INFO L290 TraceCheckUtils]: 110: Hoare triple {215768#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,162 INFO L290 TraceCheckUtils]: 111: Hoare triple {215768#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,162 INFO L290 TraceCheckUtils]: 112: Hoare triple {215768#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,162 INFO L290 TraceCheckUtils]: 113: Hoare triple {215768#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {215768#true} is VALID [2022-04-28 15:25:18,163 INFO L290 TraceCheckUtils]: 114: Hoare triple {215768#true} assume 4432 == #t~mem62;havoc #t~mem62; {215768#true} is VALID [2022-04-28 15:25:18,163 INFO L290 TraceCheckUtils]: 115: Hoare triple {215768#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {215768#true} is VALID [2022-04-28 15:25:18,163 INFO L290 TraceCheckUtils]: 116: Hoare triple {215768#true} assume !(5 == ~blastFlag~0); {215768#true} is VALID [2022-04-28 15:25:18,164 INFO L290 TraceCheckUtils]: 117: Hoare triple {215768#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); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,171 INFO L290 TraceCheckUtils]: 118: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,171 INFO L290 TraceCheckUtils]: 119: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,172 INFO L290 TraceCheckUtils]: 120: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,174 INFO L290 TraceCheckUtils]: 121: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,178 INFO L290 TraceCheckUtils]: 123: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,180 INFO L290 TraceCheckUtils]: 124: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:18,181 INFO L290 TraceCheckUtils]: 125: Hoare triple {215773#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215774#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-28 15:25:18,181 INFO L290 TraceCheckUtils]: 126: Hoare triple {215774#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {215769#false} is VALID [2022-04-28 15:25:18,181 INFO L290 TraceCheckUtils]: 127: Hoare triple {215769#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,181 INFO L290 TraceCheckUtils]: 128: Hoare triple {215769#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 129: Hoare triple {215769#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 130: Hoare triple {215769#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 131: Hoare triple {215769#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 132: Hoare triple {215769#false} assume !(0 == ~tmp___4~0); {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 133: Hoare triple {215769#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 134: Hoare triple {215769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 135: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-28 15:25:18,182 INFO L290 TraceCheckUtils]: 136: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 137: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 138: Hoare triple {215769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 139: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 140: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 141: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 142: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 143: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,183 INFO L290 TraceCheckUtils]: 144: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 145: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 146: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 147: Hoare triple {215769#false} assume 4385 == #t~mem57;havoc #t~mem57; {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 148: Hoare triple {215769#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 149: Hoare triple {215769#false} assume !(1 == ~blastFlag~0); {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 150: Hoare triple {215769#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,184 INFO L290 TraceCheckUtils]: 151: Hoare triple {215769#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 152: Hoare triple {215769#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 153: Hoare triple {215769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 154: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 155: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 156: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 157: Hoare triple {215769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,185 INFO L290 TraceCheckUtils]: 158: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 159: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 160: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 161: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 162: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 163: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 164: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 165: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,186 INFO L290 TraceCheckUtils]: 166: Hoare triple {215769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 167: Hoare triple {215769#false} assume 4400 == #t~mem58;havoc #t~mem58; {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 168: Hoare triple {215769#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 169: Hoare triple {215769#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 170: Hoare triple {215769#false} assume !(2 == ~blastFlag~0); {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 171: Hoare triple {215769#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 172: Hoare triple {215769#false} assume !(~ret~0 <= 0); {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 173: Hoare triple {215769#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,187 INFO L290 TraceCheckUtils]: 174: Hoare triple {215769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 175: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 176: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 177: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 178: Hoare triple {215769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 179: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 180: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,188 INFO L290 TraceCheckUtils]: 181: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 182: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 183: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 184: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 185: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 186: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 187: Hoare triple {215769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 188: Hoare triple {215769#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,189 INFO L290 TraceCheckUtils]: 189: Hoare triple {215769#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 190: Hoare triple {215769#false} assume 4416 == #t~mem60;havoc #t~mem60; {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 191: Hoare triple {215769#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 192: Hoare triple {215769#false} assume !(3 == ~blastFlag~0); {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 193: Hoare triple {215769#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); {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 194: Hoare triple {215769#false} assume !(0 == ~tmp___6~0); {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 195: Hoare triple {215769#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 196: Hoare triple {215769#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {215769#false} is VALID [2022-04-28 15:25:18,190 INFO L290 TraceCheckUtils]: 197: Hoare triple {215769#false} ~skip~0 := 0; {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 198: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 199: Hoare triple {215769#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 200: Hoare triple {215769#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 201: Hoare triple {215769#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 202: Hoare triple {215769#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 203: Hoare triple {215769#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,191 INFO L290 TraceCheckUtils]: 204: Hoare triple {215769#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 205: Hoare triple {215769#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 206: Hoare triple {215769#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 207: Hoare triple {215769#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 208: Hoare triple {215769#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 209: Hoare triple {215769#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 210: Hoare triple {215769#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 211: Hoare triple {215769#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,192 INFO L290 TraceCheckUtils]: 212: Hoare triple {215769#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {215769#false} is VALID [2022-04-28 15:25:18,193 INFO L290 TraceCheckUtils]: 213: Hoare triple {215769#false} assume 4432 == #t~mem62;havoc #t~mem62; {215769#false} is VALID [2022-04-28 15:25:18,193 INFO L290 TraceCheckUtils]: 214: Hoare triple {215769#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {215769#false} is VALID [2022-04-28 15:25:18,193 INFO L290 TraceCheckUtils]: 215: Hoare triple {215769#false} assume 5 == ~blastFlag~0; {215769#false} is VALID [2022-04-28 15:25:18,193 INFO L290 TraceCheckUtils]: 216: Hoare triple {215769#false} assume !false; {215769#false} is VALID [2022-04-28 15:25:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-28 15:25:18,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49855219] [2022-04-28 15:25:18,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49855219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:18,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:18,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:18,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:18,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672986165] [2022-04-28 15:25:18,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672986165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:18,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:18,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:18,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131781653] [2022-04-28 15:25:18,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:18,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 217 [2022-04-28 15:25:18,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:18,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call 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:18,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:18,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:25:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:25:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:25:18,281 INFO L87 Difference]: Start difference. First operand 1535 states and 2282 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call 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:20,300 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:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:21,932 INFO L93 Difference]: Finished difference Result 3431 states and 5068 transitions. [2022-04-28 15:25:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:25:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 217 [2022-04-28 15:25:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call 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:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 15:25:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call 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:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-28 15:25:21,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-28 15:25:22,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:22,409 INFO L225 Difference]: With dead ends: 3431 [2022-04-28 15:25:22,409 INFO L226 Difference]: Without dead ends: 1912 [2022-04-28 15:25:22,410 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:25:22,411 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:22,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:25:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-04-28 15:25:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1535. [2022-04-28 15:25:22,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:22,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call 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:22,576 INFO L74 IsIncluded]: Start isIncluded. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call 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:22,577 INFO L87 Difference]: Start difference. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call 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:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:22,668 INFO L93 Difference]: Finished difference Result 1912 states and 2772 transitions. [2022-04-28 15:25:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2772 transitions. [2022-04-28 15:25:22,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:22,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:22,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 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 1912 states. [2022-04-28 15:25:22,672 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 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 1912 states. [2022-04-28 15:25:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:22,765 INFO L93 Difference]: Finished difference Result 1912 states and 2772 transitions. [2022-04-28 15:25:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2772 transitions. [2022-04-28 15:25:22,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:22,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:22,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:22,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.4666666666666666) internal successors, (2244), 1530 states have internal predecessors, (2244), 3 states have call successors, (3), 3 states have call 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:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2248 transitions. [2022-04-28 15:25:22,871 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2248 transitions. Word has length 217 [2022-04-28 15:25:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:22,871 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 2248 transitions. [2022-04-28 15:25:22,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call 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:22,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2248 transitions. [2022-04-28 15:25:25,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2248 edges. 2248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2248 transitions. [2022-04-28 15:25:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-04-28 15:25:25,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:25,322 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:25:25,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:25:25,322 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 97880514, now seen corresponding path program 1 times [2022-04-28 15:25:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:25,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207761669] [2022-04-28 15:25:46,061 WARN L232 SmtUtils]: Spent 14.91s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:25:54,280 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash 97880514, now seen corresponding path program 2 times [2022-04-28 15:25:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:54,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682089792] [2022-04-28 15:25:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:54,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {229543#(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); {229536#true} is VALID [2022-04-28 15:25:54,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {229536#true} assume true; {229536#true} is VALID [2022-04-28 15:25:54,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {229536#true} {229536#true} #593#return; {229536#true} is VALID [2022-04-28 15:25:54,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {229536#true} call ULTIMATE.init(); {229543#(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:54,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {229543#(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); {229536#true} is VALID [2022-04-28 15:25:54,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {229536#true} assume true; {229536#true} is VALID [2022-04-28 15:25:54,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229536#true} {229536#true} #593#return; {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {229536#true} call #t~ret158 := main(); {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {229536#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; {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {229536#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {229536#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {229536#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {229536#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {229536#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {229536#true} is VALID [2022-04-28 15:25:54,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {229536#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {229536#true} assume 12292 == #t~mem49;havoc #t~mem49; {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {229536#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {229536#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {229536#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {229536#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {229536#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {229536#true} is VALID [2022-04-28 15:25:54,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {229536#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {229536#true} assume !(0 == ~tmp___4~0); {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {229536#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {229536#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {229536#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {229536#true} assume 4368 == #t~mem54;havoc #t~mem54; {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {229536#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {229536#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {229536#true} is VALID [2022-04-28 15:25:54,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {229536#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {229536#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {229536#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 39: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {229536#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 49: Hoare triple {229536#true} assume 4384 == #t~mem56;havoc #t~mem56; {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {229536#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {229536#true} is VALID [2022-04-28 15:25:54,543 INFO L290 TraceCheckUtils]: 51: Hoare triple {229536#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {229536#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {229536#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {229536#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 55: Hoare triple {229536#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-28 15:25:54,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {229536#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 61: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 65: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,545 INFO L290 TraceCheckUtils]: 67: Hoare triple {229536#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 68: Hoare triple {229536#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {229536#true} assume 4400 == #t~mem58;havoc #t~mem58; {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 70: Hoare triple {229536#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 71: Hoare triple {229536#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 72: Hoare triple {229536#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {229536#true} assume !(~ret~0 <= 0); {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 74: Hoare triple {229536#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,546 INFO L290 TraceCheckUtils]: 75: Hoare triple {229536#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 76: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 77: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 78: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 79: Hoare triple {229536#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 80: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,547 INFO L290 TraceCheckUtils]: 83: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 84: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 86: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {229536#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {229536#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 89: Hoare triple {229536#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 90: Hoare triple {229536#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {229536#true} assume 4416 == #t~mem60;havoc #t~mem60; {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 92: Hoare triple {229536#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 93: Hoare triple {229536#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 94: Hoare triple {229536#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); {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 95: Hoare triple {229536#true} assume !(0 == ~tmp___6~0); {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 96: Hoare triple {229536#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 97: Hoare triple {229536#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 98: Hoare triple {229536#true} ~skip~0 := 0; {229536#true} is VALID [2022-04-28 15:25:54,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {229536#true} assume !false; {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 100: Hoare triple {229536#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 101: Hoare triple {229536#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 102: Hoare triple {229536#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 103: Hoare triple {229536#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 104: Hoare triple {229536#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 105: Hoare triple {229536#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 106: Hoare triple {229536#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 107: Hoare triple {229536#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,550 INFO L290 TraceCheckUtils]: 108: Hoare triple {229536#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 109: Hoare triple {229536#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 110: Hoare triple {229536#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 111: Hoare triple {229536#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 112: Hoare triple {229536#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 113: Hoare triple {229536#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 114: Hoare triple {229536#true} assume 4432 == #t~mem62;havoc #t~mem62; {229536#true} is VALID [2022-04-28 15:25:54,551 INFO L290 TraceCheckUtils]: 115: Hoare triple {229536#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {229536#true} is VALID [2022-04-28 15:25:54,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {229536#true} assume !(5 == ~blastFlag~0); {229536#true} is VALID [2022-04-28 15:25:54,553 INFO L290 TraceCheckUtils]: 117: Hoare triple {229536#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); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,553 INFO L290 TraceCheckUtils]: 118: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,554 INFO L290 TraceCheckUtils]: 119: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,554 INFO L290 TraceCheckUtils]: 120: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,555 INFO L290 TraceCheckUtils]: 121: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,555 INFO L290 TraceCheckUtils]: 122: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,555 INFO L290 TraceCheckUtils]: 123: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,556 INFO L290 TraceCheckUtils]: 124: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,556 INFO L290 TraceCheckUtils]: 125: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-28 15:25:54,557 INFO L290 TraceCheckUtils]: 126: Hoare triple {229541#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229542#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-28 15:25:54,557 INFO L290 TraceCheckUtils]: 127: Hoare triple {229542#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {229537#false} is VALID [2022-04-28 15:25:54,557 INFO L290 TraceCheckUtils]: 128: Hoare triple {229537#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,557 INFO L290 TraceCheckUtils]: 129: Hoare triple {229537#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 130: Hoare triple {229537#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 131: Hoare triple {229537#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 132: Hoare triple {229537#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 133: Hoare triple {229537#false} assume !(0 == ~tmp___4~0); {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 134: Hoare triple {229537#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 135: Hoare triple {229537#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 136: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 137: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-28 15:25:54,558 INFO L290 TraceCheckUtils]: 138: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 139: Hoare triple {229537#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 140: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 141: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 142: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 143: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 144: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 145: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,559 INFO L290 TraceCheckUtils]: 146: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 147: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 148: Hoare triple {229537#false} assume 4385 == #t~mem57;havoc #t~mem57; {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 149: Hoare triple {229537#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 150: Hoare triple {229537#false} assume !(1 == ~blastFlag~0); {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 151: Hoare triple {229537#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 152: Hoare triple {229537#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 153: Hoare triple {229537#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,560 INFO L290 TraceCheckUtils]: 154: Hoare triple {229537#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 155: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 156: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 157: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 158: Hoare triple {229537#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 159: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 160: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 161: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,561 INFO L290 TraceCheckUtils]: 162: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 163: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 164: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 165: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 166: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 167: Hoare triple {229537#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 168: Hoare triple {229537#false} assume 4400 == #t~mem58;havoc #t~mem58; {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 169: Hoare triple {229537#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {229537#false} is VALID [2022-04-28 15:25:54,562 INFO L290 TraceCheckUtils]: 170: Hoare triple {229537#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 171: Hoare triple {229537#false} assume !(2 == ~blastFlag~0); {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 172: Hoare triple {229537#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 173: Hoare triple {229537#false} assume !(~ret~0 <= 0); {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 174: Hoare triple {229537#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 175: Hoare triple {229537#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 176: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 177: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 178: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-28 15:25:54,563 INFO L290 TraceCheckUtils]: 179: Hoare triple {229537#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 180: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 181: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 182: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 183: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 184: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 185: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 186: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,564 INFO L290 TraceCheckUtils]: 187: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 188: Hoare triple {229537#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 189: Hoare triple {229537#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 190: Hoare triple {229537#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 191: Hoare triple {229537#false} assume 4416 == #t~mem60;havoc #t~mem60; {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 192: Hoare triple {229537#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 193: Hoare triple {229537#false} assume !(3 == ~blastFlag~0); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 194: Hoare triple {229537#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); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 195: Hoare triple {229537#false} assume !(0 == ~tmp___6~0); {229537#false} is VALID [2022-04-28 15:25:54,565 INFO L290 TraceCheckUtils]: 196: Hoare triple {229537#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 197: Hoare triple {229537#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 198: Hoare triple {229537#false} ~skip~0 := 0; {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 199: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 200: Hoare triple {229537#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 201: Hoare triple {229537#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 202: Hoare triple {229537#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 203: Hoare triple {229537#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 204: Hoare triple {229537#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,566 INFO L290 TraceCheckUtils]: 205: Hoare triple {229537#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 206: Hoare triple {229537#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 207: Hoare triple {229537#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 208: Hoare triple {229537#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 209: Hoare triple {229537#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 210: Hoare triple {229537#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 211: Hoare triple {229537#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 212: Hoare triple {229537#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,567 INFO L290 TraceCheckUtils]: 213: Hoare triple {229537#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {229537#false} is VALID [2022-04-28 15:25:54,568 INFO L290 TraceCheckUtils]: 214: Hoare triple {229537#false} assume 4432 == #t~mem62;havoc #t~mem62; {229537#false} is VALID [2022-04-28 15:25:54,568 INFO L290 TraceCheckUtils]: 215: Hoare triple {229537#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {229537#false} is VALID [2022-04-28 15:25:54,568 INFO L290 TraceCheckUtils]: 216: Hoare triple {229537#false} assume 5 == ~blastFlag~0; {229537#false} is VALID [2022-04-28 15:25:54,568 INFO L290 TraceCheckUtils]: 217: Hoare triple {229537#false} assume !false; {229537#false} is VALID [2022-04-28 15:25:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-04-28 15:25:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:54,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682089792] [2022-04-28 15:25:54,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682089792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:54,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:54,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:54,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207761669] [2022-04-28 15:25:54,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207761669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:54,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:54,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37691326] [2022-04-28 15:25:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:54,571 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 218 [2022-04-28 15:25:54,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:54,571 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:25:54,674 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:25:54,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:25:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:25:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:25:54,675 INFO L87 Difference]: Start difference. First operand 1535 states and 2248 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:25:56,697 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:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:58,358 INFO L93 Difference]: Finished difference Result 3431 states and 5000 transitions. [2022-04-28 15:25:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:25:58,359 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 218 [2022-04-28 15:25:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:58,359 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:25:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:25:58,361 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:25:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:25:58,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:25:58,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:58,838 INFO L225 Difference]: With dead ends: 3431 [2022-04-28 15:25:58,839 INFO L226 Difference]: Without dead ends: 1912 [2022-04-28 15:25:58,841 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:25:58,841 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 114 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:58,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:25:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2022-04-28 15:25:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1535. [2022-04-28 15:25:58,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:58,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call 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:58,981 INFO L74 IsIncluded]: Start isIncluded. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call 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:58,982 INFO L87 Difference]: Start difference. First operand 1912 states. Second operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call 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:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:59,106 INFO L93 Difference]: Finished difference Result 1912 states and 2738 transitions. [2022-04-28 15:25:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2738 transitions. [2022-04-28 15:25:59,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:59,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:59,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 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 1912 states. [2022-04-28 15:25:59,112 INFO L87 Difference]: Start difference. First operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 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 1912 states. [2022-04-28 15:25:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:59,204 INFO L93 Difference]: Finished difference Result 1912 states and 2738 transitions. [2022-04-28 15:25:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2738 transitions. [2022-04-28 15:25:59,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:59,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:59,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:59,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1530 states have (on average 1.4444444444444444) internal successors, (2210), 1530 states have internal predecessors, (2210), 3 states have call successors, (3), 3 states have call 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:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2214 transitions. [2022-04-28 15:25:59,306 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2214 transitions. Word has length 218 [2022-04-28 15:25:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:59,307 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 2214 transitions. [2022-04-28 15:25:59,307 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:25:59,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1535 states and 2214 transitions. [2022-04-28 15:26:01,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2214 edges. 2214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2214 transitions. [2022-04-28 15:26:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-04-28 15:26:01,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:01,784 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:01,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:26:01,784 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -252957758, now seen corresponding path program 1 times [2022-04-28 15:26:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:01,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166691195] [2022-04-28 15:26:22,160 WARN L232 SmtUtils]: Spent 12.72s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:26:34,808 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:26:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -252957758, now seen corresponding path program 2 times [2022-04-28 15:26:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063282268] [2022-04-28 15:26:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:35,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {243311#(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); {243304#true} is VALID [2022-04-28 15:26:35,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {243304#true} assume true; {243304#true} is VALID [2022-04-28 15:26:35,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243304#true} {243304#true} #593#return; {243304#true} is VALID [2022-04-28 15:26:35,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {243304#true} call ULTIMATE.init(); {243311#(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:35,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {243311#(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); {243304#true} is VALID [2022-04-28 15:26:35,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {243304#true} assume true; {243304#true} is VALID [2022-04-28 15:26:35,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243304#true} {243304#true} #593#return; {243304#true} is VALID [2022-04-28 15:26:35,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {243304#true} call #t~ret158 := main(); {243304#true} is VALID [2022-04-28 15:26:35,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {243304#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; {243304#true} is VALID [2022-04-28 15:26:35,045 INFO L272 TraceCheckUtils]: 6: Hoare triple {243304#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {243304#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {243304#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {243304#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {243304#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {243304#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {243304#true} assume 12292 == #t~mem49;havoc #t~mem49; {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {243304#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {243304#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {243304#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {243304#true} is VALID [2022-04-28 15:26:35,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {243304#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {243304#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {243304#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {243304#true} assume !(0 == ~tmp___4~0); {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {243304#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {243304#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {243304#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {243304#true} assume 4368 == #t~mem54;havoc #t~mem54; {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {243304#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {243304#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {243304#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {243304#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {243304#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {243304#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {243304#true} assume 4384 == #t~mem56;havoc #t~mem56; {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {243304#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 51: Hoare triple {243304#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {243304#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {243304#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {243304#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {243304#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {243304#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {243304#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {243304#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {243304#true} assume 4400 == #t~mem58;havoc #t~mem58; {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {243304#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {243304#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {243304#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {243304#true} assume !(~ret~0 <= 0); {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {243304#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {243304#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 77: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 78: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 79: Hoare triple {243304#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 81: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,053 INFO L290 TraceCheckUtils]: 82: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 83: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 84: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 85: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 86: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 87: Hoare triple {243304#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 88: Hoare triple {243304#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,054 INFO L290 TraceCheckUtils]: 89: Hoare triple {243304#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {243304#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 91: Hoare triple {243304#true} assume 4416 == #t~mem60;havoc #t~mem60; {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {243304#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {243304#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {243304#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); {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 95: Hoare triple {243304#true} assume !(0 == ~tmp___6~0); {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 96: Hoare triple {243304#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,055 INFO L290 TraceCheckUtils]: 97: Hoare triple {243304#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 98: Hoare triple {243304#true} ~skip~0 := 0; {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 99: Hoare triple {243304#true} assume !false; {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {243304#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {243304#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {243304#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {243304#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {243304#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {243304#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 106: Hoare triple {243304#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 107: Hoare triple {243304#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 108: Hoare triple {243304#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 109: Hoare triple {243304#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 110: Hoare triple {243304#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 111: Hoare triple {243304#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 112: Hoare triple {243304#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 113: Hoare triple {243304#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {243304#true} is VALID [2022-04-28 15:26:35,057 INFO L290 TraceCheckUtils]: 114: Hoare triple {243304#true} assume 4432 == #t~mem62;havoc #t~mem62; {243304#true} is VALID [2022-04-28 15:26:35,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {243304#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {243304#true} is VALID [2022-04-28 15:26:35,058 INFO L290 TraceCheckUtils]: 116: Hoare triple {243304#true} assume !(5 == ~blastFlag~0); {243304#true} is VALID [2022-04-28 15:26:35,059 INFO L290 TraceCheckUtils]: 117: Hoare triple {243304#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); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,059 INFO L290 TraceCheckUtils]: 118: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,060 INFO L290 TraceCheckUtils]: 119: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,060 INFO L290 TraceCheckUtils]: 120: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} ~skip~0 := 0; {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,060 INFO L290 TraceCheckUtils]: 121: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !false; {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,061 INFO L290 TraceCheckUtils]: 122: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,061 INFO L290 TraceCheckUtils]: 123: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,061 INFO L290 TraceCheckUtils]: 124: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,062 INFO L290 TraceCheckUtils]: 125: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,062 INFO L290 TraceCheckUtils]: 126: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,062 INFO L290 TraceCheckUtils]: 127: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,063 INFO L290 TraceCheckUtils]: 128: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,063 INFO L290 TraceCheckUtils]: 129: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,063 INFO L290 TraceCheckUtils]: 130: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,064 INFO L290 TraceCheckUtils]: 131: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,064 INFO L290 TraceCheckUtils]: 132: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,064 INFO L290 TraceCheckUtils]: 133: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,065 INFO L290 TraceCheckUtils]: 134: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,065 INFO L290 TraceCheckUtils]: 135: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,065 INFO L290 TraceCheckUtils]: 136: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} is VALID [2022-04-28 15:26:35,066 INFO L290 TraceCheckUtils]: 137: Hoare triple {243309#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4448)} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {243310#(= |ssl3_connect_#t~mem64| 4448)} is VALID [2022-04-28 15:26:35,066 INFO L290 TraceCheckUtils]: 138: Hoare triple {243310#(= |ssl3_connect_#t~mem64| 4448)} assume !(4448 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,066 INFO L290 TraceCheckUtils]: 139: Hoare triple {243305#false} assume !(4449 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 140: Hoare triple {243305#false} assume !(4464 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 141: Hoare triple {243305#false} assume !(4465 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 142: Hoare triple {243305#false} assume !(4466 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 143: Hoare triple {243305#false} assume !(4467 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 144: Hoare triple {243305#false} assume !(4480 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 145: Hoare triple {243305#false} assume !(4481 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 146: Hoare triple {243305#false} assume !(4496 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,067 INFO L290 TraceCheckUtils]: 147: Hoare triple {243305#false} assume !(4497 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 148: Hoare triple {243305#false} assume !(4512 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 149: Hoare triple {243305#false} assume 4513 == #t~mem75;havoc #t~mem75; {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 150: Hoare triple {243305#false} assume -2147483648 <= #t~nondet113 && #t~nondet113 <= 2147483647;~ret~0 := #t~nondet113;havoc #t~nondet113; {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 151: Hoare triple {243305#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~mem114.base, #t~mem114.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem115.base, #t~mem115.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem116.base, #t~mem116.offset := read~$Pointer$(#t~mem115.base, 888 + #t~mem115.offset, 8);call write~$Pointer$(#t~mem116.base, #t~mem116.offset, #t~mem114.base, 192 + #t~mem114.offset, 8);havoc #t~mem114.base, #t~mem114.offset;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116.base, #t~mem116.offset;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 967 + #t~mem117.offset, 8); {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 152: Hoare triple {243305#false} assume 0 == (#t~mem118.base + #t~mem118.offset) % 18446744073709551616;havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset;call #t~mem119.base, #t~mem119.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call write~int(0, #t~mem119.base, 188 + #t~mem119.offset, 4);havoc #t~mem119.base, #t~mem119.offset; {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 153: Hoare triple {243305#false} assume !(0 == ~tmp___7~0); {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 154: Hoare triple {243305#false} assume !(0 == ~tmp___8~0); {243305#false} is VALID [2022-04-28 15:26:35,068 INFO L290 TraceCheckUtils]: 155: Hoare triple {243305#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 156: Hoare triple {243305#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 157: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 158: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 159: Hoare triple {243305#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 160: Hoare triple {243305#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 161: Hoare triple {243305#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 162: Hoare triple {243305#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,069 INFO L290 TraceCheckUtils]: 163: Hoare triple {243305#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 164: Hoare triple {243305#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 165: Hoare triple {243305#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 166: Hoare triple {243305#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 167: Hoare triple {243305#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 168: Hoare triple {243305#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 169: Hoare triple {243305#false} assume 4400 == #t~mem58;havoc #t~mem58; {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 170: Hoare triple {243305#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {243305#false} is VALID [2022-04-28 15:26:35,070 INFO L290 TraceCheckUtils]: 171: Hoare triple {243305#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 172: Hoare triple {243305#false} assume !(2 == ~blastFlag~0); {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 173: Hoare triple {243305#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 174: Hoare triple {243305#false} assume !(~ret~0 <= 0); {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 175: Hoare triple {243305#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 176: Hoare triple {243305#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 177: Hoare triple {243305#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 178: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-28 15:26:35,071 INFO L290 TraceCheckUtils]: 179: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 180: Hoare triple {243305#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 181: Hoare triple {243305#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 182: Hoare triple {243305#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 183: Hoare triple {243305#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 184: Hoare triple {243305#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 185: Hoare triple {243305#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 186: Hoare triple {243305#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 187: Hoare triple {243305#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,072 INFO L290 TraceCheckUtils]: 188: Hoare triple {243305#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 189: Hoare triple {243305#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 190: Hoare triple {243305#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 191: Hoare triple {243305#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 192: Hoare triple {243305#false} assume 4416 == #t~mem60;havoc #t~mem60; {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 193: Hoare triple {243305#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 194: Hoare triple {243305#false} assume !(3 == ~blastFlag~0); {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 195: Hoare triple {243305#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); {243305#false} is VALID [2022-04-28 15:26:35,073 INFO L290 TraceCheckUtils]: 196: Hoare triple {243305#false} assume !(0 == ~tmp___6~0); {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 197: Hoare triple {243305#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 198: Hoare triple {243305#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 199: Hoare triple {243305#false} ~skip~0 := 0; {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 200: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 201: Hoare triple {243305#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 202: Hoare triple {243305#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 203: Hoare triple {243305#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 204: Hoare triple {243305#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,074 INFO L290 TraceCheckUtils]: 205: Hoare triple {243305#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 206: Hoare triple {243305#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 207: Hoare triple {243305#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 208: Hoare triple {243305#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 209: Hoare triple {243305#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 210: Hoare triple {243305#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 211: Hoare triple {243305#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 212: Hoare triple {243305#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,075 INFO L290 TraceCheckUtils]: 213: Hoare triple {243305#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,076 INFO L290 TraceCheckUtils]: 214: Hoare triple {243305#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {243305#false} is VALID [2022-04-28 15:26:35,076 INFO L290 TraceCheckUtils]: 215: Hoare triple {243305#false} assume 4432 == #t~mem62;havoc #t~mem62; {243305#false} is VALID [2022-04-28 15:26:35,076 INFO L290 TraceCheckUtils]: 216: Hoare triple {243305#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {243305#false} is VALID [2022-04-28 15:26:35,076 INFO L290 TraceCheckUtils]: 217: Hoare triple {243305#false} assume 5 == ~blastFlag~0; {243305#false} is VALID [2022-04-28 15:26:35,076 INFO L290 TraceCheckUtils]: 218: Hoare triple {243305#false} assume !false; {243305#false} is VALID [2022-04-28 15:26:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-04-28 15:26:35,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063282268] [2022-04-28 15:26:35,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063282268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:35,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:35,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:35,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166691195] [2022-04-28 15:26:35,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166691195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:35,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:35,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534982446] [2022-04-28 15:26:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 219 [2022-04-28 15:26:35,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:35,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call 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:35,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:35,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:35,168 INFO L87 Difference]: Start difference. First operand 1535 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call 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:37,188 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:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:38,600 INFO L93 Difference]: Finished difference Result 3131 states and 4510 transitions. [2022-04-28 15:26:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 219 [2022-04-28 15:26:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call 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:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2022-04-28 15:26:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call 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:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2022-04-28 15:26:38,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 375 transitions. [2022-04-28 15:26:38,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:38,937 INFO L225 Difference]: With dead ends: 3131 [2022-04-28 15:26:38,938 INFO L226 Difference]: Without dead ends: 1612 [2022-04-28 15:26:38,939 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:26:38,939 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 17 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:38,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 466 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:26:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-04-28 15:26:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1577. [2022-04-28 15:26:39,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:39,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1612 states. Second operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call 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:39,085 INFO L74 IsIncluded]: Start isIncluded. First operand 1612 states. Second operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call 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:39,086 INFO L87 Difference]: Start difference. First operand 1612 states. Second operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call 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:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:39,154 INFO L93 Difference]: Finished difference Result 1612 states and 2310 transitions. [2022-04-28 15:26:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2310 transitions. [2022-04-28 15:26:39,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:39,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:39,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 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 1612 states. [2022-04-28 15:26:39,157 INFO L87 Difference]: Start difference. First operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 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 1612 states. [2022-04-28 15:26:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:39,225 INFO L93 Difference]: Finished difference Result 1612 states and 2310 transitions. [2022-04-28 15:26:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2310 transitions. [2022-04-28 15:26:39,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:39,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:39,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:39,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1572 states have (on average 1.440203562340967) internal successors, (2264), 1572 states have internal predecessors, (2264), 3 states have call successors, (3), 3 states have call 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:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2268 transitions. [2022-04-28 15:26:39,343 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2268 transitions. Word has length 219 [2022-04-28 15:26:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:39,344 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2268 transitions. [2022-04-28 15:26:39,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call 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:39,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1577 states and 2268 transitions. [2022-04-28 15:26:41,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2268 edges. 2268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2268 transitions. [2022-04-28 15:26:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-28 15:26:41,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:41,887 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:41,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:26:41,887 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash 944424234, now seen corresponding path program 1 times [2022-04-28 15:26:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:41,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [655229947] [2022-04-28 15:26:59,802 WARN L232 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:27:06,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash 944424234, now seen corresponding path program 2 times [2022-04-28 15:27:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:06,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350394199] [2022-04-28 15:27:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:06,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {255963#(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); {255956#true} is VALID [2022-04-28 15:27:06,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {255956#true} assume true; {255956#true} is VALID [2022-04-28 15:27:06,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {255956#true} {255956#true} #593#return; {255956#true} is VALID [2022-04-28 15:27:06,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {255956#true} call ULTIMATE.init(); {255963#(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:27:06,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {255963#(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); {255956#true} is VALID [2022-04-28 15:27:06,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {255956#true} assume true; {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255956#true} {255956#true} #593#return; {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {255956#true} call #t~ret158 := main(); {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {255956#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; {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {255956#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {255956#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {255956#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {255956#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {255956#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {255956#true} assume 12292 == #t~mem49;havoc #t~mem49; {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {255956#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {255956#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {255956#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {255956#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {255956#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {255956#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {255956#true} assume !(0 == ~tmp___4~0); {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {255956#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {255956#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-28 15:27:06,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {255956#true} assume 4368 == #t~mem54;havoc #t~mem54; {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {255956#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {255956#true} is VALID [2022-04-28 15:27:06,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {255956#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {255956#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {255956#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {255956#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {255956#true} assume 4384 == #t~mem56;havoc #t~mem56; {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {255956#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {255956#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {255956#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {255956#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {255956#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {255956#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {255956#true} assume 4400 == #t~mem58;havoc #t~mem58; {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {255956#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {255956#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {255956#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {255956#true} assume !(~ret~0 <= 0); {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 74: Hoare triple {255956#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {255956#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 76: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-28 15:27:06,805 INFO L290 TraceCheckUtils]: 77: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 80: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 81: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 82: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 83: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 84: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 85: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {255956#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {255956#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {255956#true} assume 4416 == #t~mem60;havoc #t~mem60; {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {255956#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {255956#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {255956#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); {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {255956#true} assume !(0 == ~tmp___6~0); {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 96: Hoare triple {255956#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 97: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 98: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-28 15:27:06,807 INFO L290 TraceCheckUtils]: 99: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 100: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 101: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 102: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 103: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 104: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 105: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 106: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 107: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 108: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 109: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,808 INFO L290 TraceCheckUtils]: 110: Hoare triple {255956#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 111: Hoare triple {255956#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 112: Hoare triple {255956#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 113: Hoare triple {255956#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 114: Hoare triple {255956#true} assume 4432 == #t~mem62;havoc #t~mem62; {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 115: Hoare triple {255956#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 116: Hoare triple {255956#true} assume !(5 == ~blastFlag~0); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 117: Hoare triple {255956#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); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 118: Hoare triple {255956#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 119: Hoare triple {255956#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255956#true} is VALID [2022-04-28 15:27:06,809 INFO L290 TraceCheckUtils]: 120: Hoare triple {255956#true} ~skip~0 := 0; {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 121: Hoare triple {255956#true} assume !false; {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 122: Hoare triple {255956#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 123: Hoare triple {255956#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 124: Hoare triple {255956#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 125: Hoare triple {255956#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 126: Hoare triple {255956#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 127: Hoare triple {255956#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 128: Hoare triple {255956#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 129: Hoare triple {255956#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 130: Hoare triple {255956#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,810 INFO L290 TraceCheckUtils]: 131: Hoare triple {255956#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 132: Hoare triple {255956#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 133: Hoare triple {255956#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 134: Hoare triple {255956#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 135: Hoare triple {255956#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 136: Hoare triple {255956#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 137: Hoare triple {255956#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 138: Hoare triple {255956#true} assume 4448 == #t~mem64;havoc #t~mem64; {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 139: Hoare triple {255956#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {255956#true} is VALID [2022-04-28 15:27:06,811 INFO L290 TraceCheckUtils]: 140: Hoare triple {255956#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {255956#true} is VALID [2022-04-28 15:27:06,812 INFO L290 TraceCheckUtils]: 141: Hoare triple {255956#true} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,813 INFO L290 TraceCheckUtils]: 142: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,813 INFO L290 TraceCheckUtils]: 143: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,813 INFO L290 TraceCheckUtils]: 144: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,814 INFO L290 TraceCheckUtils]: 145: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} ~skip~0 := 0; {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,814 INFO L290 TraceCheckUtils]: 146: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !false; {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,814 INFO L290 TraceCheckUtils]: 147: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,815 INFO L290 TraceCheckUtils]: 148: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,815 INFO L290 TraceCheckUtils]: 149: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,815 INFO L290 TraceCheckUtils]: 150: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,816 INFO L290 TraceCheckUtils]: 151: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,816 INFO L290 TraceCheckUtils]: 152: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,816 INFO L290 TraceCheckUtils]: 153: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,816 INFO L290 TraceCheckUtils]: 154: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:27:06,817 INFO L290 TraceCheckUtils]: 155: Hoare triple {255961#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255962#(= |ssl3_connect_#t~mem57| 4480)} is VALID [2022-04-28 15:27:06,817 INFO L290 TraceCheckUtils]: 156: Hoare triple {255962#(= |ssl3_connect_#t~mem57| 4480)} assume 4385 == #t~mem57;havoc #t~mem57; {255957#false} is VALID [2022-04-28 15:27:06,817 INFO L290 TraceCheckUtils]: 157: Hoare triple {255957#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {255957#false} is VALID [2022-04-28 15:27:06,817 INFO L290 TraceCheckUtils]: 158: Hoare triple {255957#false} assume !(1 == ~blastFlag~0); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 159: Hoare triple {255957#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 160: Hoare triple {255957#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 161: Hoare triple {255957#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 162: Hoare triple {255957#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 163: Hoare triple {255957#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 164: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 165: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 166: Hoare triple {255957#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 167: Hoare triple {255957#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 168: Hoare triple {255957#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,818 INFO L290 TraceCheckUtils]: 169: Hoare triple {255957#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 170: Hoare triple {255957#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 171: Hoare triple {255957#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 172: Hoare triple {255957#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 173: Hoare triple {255957#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 174: Hoare triple {255957#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 175: Hoare triple {255957#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 176: Hoare triple {255957#false} assume 4400 == #t~mem58;havoc #t~mem58; {255957#false} is VALID [2022-04-28 15:27:06,819 INFO L290 TraceCheckUtils]: 177: Hoare triple {255957#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 178: Hoare triple {255957#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 179: Hoare triple {255957#false} assume !(2 == ~blastFlag~0); {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 180: Hoare triple {255957#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 181: Hoare triple {255957#false} assume !(~ret~0 <= 0); {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 182: Hoare triple {255957#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 183: Hoare triple {255957#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,820 INFO L290 TraceCheckUtils]: 184: Hoare triple {255957#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 185: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 186: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 187: Hoare triple {255957#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 188: Hoare triple {255957#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 189: Hoare triple {255957#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 190: Hoare triple {255957#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,821 INFO L290 TraceCheckUtils]: 191: Hoare triple {255957#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 192: Hoare triple {255957#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 193: Hoare triple {255957#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 194: Hoare triple {255957#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 195: Hoare triple {255957#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 196: Hoare triple {255957#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 197: Hoare triple {255957#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,822 INFO L290 TraceCheckUtils]: 198: Hoare triple {255957#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 199: Hoare triple {255957#false} assume 4416 == #t~mem60;havoc #t~mem60; {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 200: Hoare triple {255957#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 201: Hoare triple {255957#false} assume !(3 == ~blastFlag~0); {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 202: Hoare triple {255957#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); {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 203: Hoare triple {255957#false} assume !(0 == ~tmp___6~0); {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 204: Hoare triple {255957#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,823 INFO L290 TraceCheckUtils]: 205: Hoare triple {255957#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 206: Hoare triple {255957#false} ~skip~0 := 0; {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 207: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 208: Hoare triple {255957#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 209: Hoare triple {255957#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 210: Hoare triple {255957#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 211: Hoare triple {255957#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,824 INFO L290 TraceCheckUtils]: 212: Hoare triple {255957#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 213: Hoare triple {255957#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 214: Hoare triple {255957#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 215: Hoare triple {255957#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 216: Hoare triple {255957#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 217: Hoare triple {255957#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 218: Hoare triple {255957#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 219: Hoare triple {255957#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,825 INFO L290 TraceCheckUtils]: 220: Hoare triple {255957#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,826 INFO L290 TraceCheckUtils]: 221: Hoare triple {255957#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {255957#false} is VALID [2022-04-28 15:27:06,826 INFO L290 TraceCheckUtils]: 222: Hoare triple {255957#false} assume 4432 == #t~mem62;havoc #t~mem62; {255957#false} is VALID [2022-04-28 15:27:06,826 INFO L290 TraceCheckUtils]: 223: Hoare triple {255957#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {255957#false} is VALID [2022-04-28 15:27:06,826 INFO L290 TraceCheckUtils]: 224: Hoare triple {255957#false} assume 5 == ~blastFlag~0; {255957#false} is VALID [2022-04-28 15:27:06,826 INFO L290 TraceCheckUtils]: 225: Hoare triple {255957#false} assume !false; {255957#false} is VALID [2022-04-28 15:27:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-28 15:27:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:06,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350394199] [2022-04-28 15:27:06,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350394199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:06,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:06,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:06,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:06,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [655229947] [2022-04-28 15:27:06,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [655229947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:06,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:06,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639127674] [2022-04-28 15:27:06,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:06,829 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 226 [2022-04-28 15:27:06,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:06,829 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:27:06,931 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:27:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:06,932 INFO L87 Difference]: Start difference. First operand 1577 states and 2268 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:27:08,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:10,867 INFO L93 Difference]: Finished difference Result 3587 states and 5152 transitions. [2022-04-28 15:27:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:10,868 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 226 [2022-04-28 15:27:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:10,868 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:27:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 15:27:10,870 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:27:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 15:27:10,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-28 15:27:11,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:11,332 INFO L225 Difference]: With dead ends: 3587 [2022-04-28 15:27:11,332 INFO L226 Difference]: Without dead ends: 2026 [2022-04-28 15:27:11,333 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:27:11,334 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 73 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:11,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 526 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:27:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-04-28 15:27:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1697. [2022-04-28 15:27:11,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:11,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2026 states. Second operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,489 INFO L74 IsIncluded]: Start isIncluded. First operand 2026 states. Second operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,490 INFO L87 Difference]: Start difference. First operand 2026 states. Second operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:11,596 INFO L93 Difference]: Finished difference Result 2026 states and 2898 transitions. [2022-04-28 15:27:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2898 transitions. [2022-04-28 15:27:11,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:11,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:11,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 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 2026 states. [2022-04-28 15:27:11,601 INFO L87 Difference]: Start difference. First operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 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 2026 states. [2022-04-28 15:27:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:11,714 INFO L93 Difference]: Finished difference Result 2026 states and 2898 transitions. [2022-04-28 15:27:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2898 transitions. [2022-04-28 15:27:11,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:11,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:11,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:11,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1692 states have (on average 1.433806146572104) internal successors, (2426), 1692 states have internal predecessors, (2426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2430 transitions. [2022-04-28 15:27:11,845 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2430 transitions. Word has length 226 [2022-04-28 15:27:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:11,845 INFO L495 AbstractCegarLoop]: Abstraction has 1697 states and 2430 transitions. [2022-04-28 15:27:11,847 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:27:11,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1697 states and 2430 transitions. [2022-04-28 15:27:14,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2430 edges. 2430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2430 transitions. [2022-04-28 15:27:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-04-28 15:27:14,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:14,622 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:14,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:27:14,622 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash -932058584, now seen corresponding path program 1 times [2022-04-28 15:27:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:14,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169049102] [2022-04-28 15:27:31,633 WARN L232 SmtUtils]: Spent 11.66s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:27:41,136 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -932058584, now seen corresponding path program 2 times [2022-04-28 15:27:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:41,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685402616] [2022-04-28 15:27:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:41,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {270595#(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); {270588#true} is VALID [2022-04-28 15:27:41,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {270588#true} assume true; {270588#true} is VALID [2022-04-28 15:27:41,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {270588#true} {270588#true} #593#return; {270588#true} is VALID [2022-04-28 15:27:41,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {270588#true} call ULTIMATE.init(); {270595#(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:27:41,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {270595#(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); {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {270588#true} assume true; {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270588#true} {270588#true} #593#return; {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {270588#true} call #t~ret158 := main(); {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {270588#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; {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {270588#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {270588#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {270588#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {270588#true} is VALID [2022-04-28 15:27:41,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {270588#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {270588#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {270588#true} assume 12292 == #t~mem49;havoc #t~mem49; {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {270588#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {270588#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {270588#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {270588#true} is VALID [2022-04-28 15:27:41,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {270588#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {270588#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {270588#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {270588#true} assume !(0 == ~tmp___4~0); {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {270588#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {270588#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {270588#true} assume 4368 == #t~mem54;havoc #t~mem54; {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {270588#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {270588#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {270588#true} is VALID [2022-04-28 15:27:41,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {270588#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {270588#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {270588#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {270588#true} assume 4384 == #t~mem56;havoc #t~mem56; {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {270588#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {270588#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {270588#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {270588#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {270588#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {270588#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {270588#true} assume 4400 == #t~mem58;havoc #t~mem58; {270588#true} is VALID [2022-04-28 15:27:41,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {270588#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {270588#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {270588#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {270588#true} assume !(~ret~0 <= 0); {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {270588#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {270588#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 78: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 81: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,383 INFO L290 TraceCheckUtils]: 87: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 88: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 89: Hoare triple {270588#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 90: Hoare triple {270588#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 91: Hoare triple {270588#true} assume 4416 == #t~mem60;havoc #t~mem60; {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 92: Hoare triple {270588#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 93: Hoare triple {270588#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 94: Hoare triple {270588#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); {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 95: Hoare triple {270588#true} assume !(0 == ~tmp___6~0); {270588#true} is VALID [2022-04-28 15:27:41,384 INFO L290 TraceCheckUtils]: 96: Hoare triple {270588#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 99: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 100: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 101: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 102: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 103: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,385 INFO L290 TraceCheckUtils]: 105: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 108: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 109: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 110: Hoare triple {270588#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 111: Hoare triple {270588#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {270588#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {270588#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 114: Hoare triple {270588#true} assume 4432 == #t~mem62;havoc #t~mem62; {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 115: Hoare triple {270588#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 116: Hoare triple {270588#true} assume !(5 == ~blastFlag~0); {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 117: Hoare triple {270588#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); {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 118: Hoare triple {270588#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 119: Hoare triple {270588#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 120: Hoare triple {270588#true} ~skip~0 := 0; {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 121: Hoare triple {270588#true} assume !false; {270588#true} is VALID [2022-04-28 15:27:41,387 INFO L290 TraceCheckUtils]: 122: Hoare triple {270588#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 123: Hoare triple {270588#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 124: Hoare triple {270588#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 125: Hoare triple {270588#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 126: Hoare triple {270588#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 127: Hoare triple {270588#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 128: Hoare triple {270588#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 129: Hoare triple {270588#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 130: Hoare triple {270588#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,388 INFO L290 TraceCheckUtils]: 131: Hoare triple {270588#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 132: Hoare triple {270588#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 133: Hoare triple {270588#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 134: Hoare triple {270588#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 135: Hoare triple {270588#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 136: Hoare triple {270588#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 137: Hoare triple {270588#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 138: Hoare triple {270588#true} assume 4448 == #t~mem64;havoc #t~mem64; {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 139: Hoare triple {270588#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {270588#true} is VALID [2022-04-28 15:27:41,389 INFO L290 TraceCheckUtils]: 140: Hoare triple {270588#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {270588#true} is VALID [2022-04-28 15:27:41,390 INFO L290 TraceCheckUtils]: 141: Hoare triple {270588#true} assume 0 != #t~mem102;havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4464, ~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,391 INFO L290 TraceCheckUtils]: 142: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,392 INFO L290 TraceCheckUtils]: 143: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,392 INFO L290 TraceCheckUtils]: 144: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,393 INFO L290 TraceCheckUtils]: 145: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} ~skip~0 := 0; {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,393 INFO L290 TraceCheckUtils]: 146: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,393 INFO L290 TraceCheckUtils]: 147: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,394 INFO L290 TraceCheckUtils]: 148: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,394 INFO L290 TraceCheckUtils]: 149: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,395 INFO L290 TraceCheckUtils]: 150: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,395 INFO L290 TraceCheckUtils]: 151: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,396 INFO L290 TraceCheckUtils]: 152: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,396 INFO L290 TraceCheckUtils]: 153: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,397 INFO L290 TraceCheckUtils]: 154: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-28 15:27:41,397 INFO L290 TraceCheckUtils]: 155: Hoare triple {270593#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270594#(= |ssl3_connect_#t~mem57| 4464)} is VALID [2022-04-28 15:27:41,397 INFO L290 TraceCheckUtils]: 156: Hoare triple {270594#(= |ssl3_connect_#t~mem57| 4464)} assume 4385 == #t~mem57;havoc #t~mem57; {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 157: Hoare triple {270589#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 158: Hoare triple {270589#false} assume !(1 == ~blastFlag~0); {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 159: Hoare triple {270589#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 160: Hoare triple {270589#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 161: Hoare triple {270589#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 162: Hoare triple {270589#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 163: Hoare triple {270589#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270589#false} is VALID [2022-04-28 15:27:41,398 INFO L290 TraceCheckUtils]: 164: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 165: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 166: Hoare triple {270589#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 167: Hoare triple {270589#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 168: Hoare triple {270589#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 169: Hoare triple {270589#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 170: Hoare triple {270589#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 171: Hoare triple {270589#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,399 INFO L290 TraceCheckUtils]: 172: Hoare triple {270589#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 173: Hoare triple {270589#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 174: Hoare triple {270589#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 175: Hoare triple {270589#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 176: Hoare triple {270589#false} assume 4400 == #t~mem58;havoc #t~mem58; {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 177: Hoare triple {270589#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 178: Hoare triple {270589#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 179: Hoare triple {270589#false} assume !(2 == ~blastFlag~0); {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 180: Hoare triple {270589#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {270589#false} is VALID [2022-04-28 15:27:41,400 INFO L290 TraceCheckUtils]: 181: Hoare triple {270589#false} assume !(~ret~0 <= 0); {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 182: Hoare triple {270589#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 183: Hoare triple {270589#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 184: Hoare triple {270589#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 185: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 186: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 187: Hoare triple {270589#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 188: Hoare triple {270589#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 189: Hoare triple {270589#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,401 INFO L290 TraceCheckUtils]: 190: Hoare triple {270589#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 191: Hoare triple {270589#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 192: Hoare triple {270589#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 193: Hoare triple {270589#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 194: Hoare triple {270589#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 195: Hoare triple {270589#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 196: Hoare triple {270589#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 197: Hoare triple {270589#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,402 INFO L290 TraceCheckUtils]: 198: Hoare triple {270589#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 199: Hoare triple {270589#false} assume 4416 == #t~mem60;havoc #t~mem60; {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 200: Hoare triple {270589#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 201: Hoare triple {270589#false} assume !(3 == ~blastFlag~0); {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 202: Hoare triple {270589#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); {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 203: Hoare triple {270589#false} assume !(0 == ~tmp___6~0); {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 204: Hoare triple {270589#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 205: Hoare triple {270589#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 206: Hoare triple {270589#false} ~skip~0 := 0; {270589#false} is VALID [2022-04-28 15:27:41,403 INFO L290 TraceCheckUtils]: 207: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 208: Hoare triple {270589#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 209: Hoare triple {270589#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 210: Hoare triple {270589#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 211: Hoare triple {270589#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 212: Hoare triple {270589#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 213: Hoare triple {270589#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 214: Hoare triple {270589#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,404 INFO L290 TraceCheckUtils]: 215: Hoare triple {270589#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 216: Hoare triple {270589#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 217: Hoare triple {270589#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 218: Hoare triple {270589#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 219: Hoare triple {270589#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 220: Hoare triple {270589#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 221: Hoare triple {270589#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 222: Hoare triple {270589#false} assume 4432 == #t~mem62;havoc #t~mem62; {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 223: Hoare triple {270589#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {270589#false} is VALID [2022-04-28 15:27:41,405 INFO L290 TraceCheckUtils]: 224: Hoare triple {270589#false} assume 5 == ~blastFlag~0; {270589#false} is VALID [2022-04-28 15:27:41,406 INFO L290 TraceCheckUtils]: 225: Hoare triple {270589#false} assume !false; {270589#false} is VALID [2022-04-28 15:27:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-04-28 15:27:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:41,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685402616] [2022-04-28 15:27:41,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685402616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:41,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:41,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:41,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:41,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169049102] [2022-04-28 15:27:41,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169049102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:41,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:41,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968247396] [2022-04-28 15:27:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:41,410 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 226 [2022-04-28 15:27:41,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:41,411 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:27:41,512 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:27:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:41,513 INFO L87 Difference]: Start difference. First operand 1697 states and 2430 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:27:43,541 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:27:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:45,578 INFO L93 Difference]: Finished difference Result 3821 states and 5470 transitions. [2022-04-28 15:27:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:45,578 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 226 [2022-04-28 15:27:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:45,579 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:27:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 15:27:45,581 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:27:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-28 15:27:45,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-28 15:27:45,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:46,086 INFO L225 Difference]: With dead ends: 3821 [2022-04-28 15:27:46,086 INFO L226 Difference]: Without dead ends: 2140 [2022-04-28 15:27:46,089 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:27:46,089 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 73 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:46,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 528 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 493 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:27:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-04-28 15:27:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1691. [2022-04-28 15:27:46,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:46,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:46,251 INFO L74 IsIncluded]: Start isIncluded. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:46,252 INFO L87 Difference]: Start difference. First operand 2140 states. Second operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:46,366 INFO L93 Difference]: Finished difference Result 2140 states and 3054 transitions. [2022-04-28 15:27:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3054 transitions. [2022-04-28 15:27:46,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:46,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:46,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 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 2140 states. [2022-04-28 15:27:46,370 INFO L87 Difference]: Start difference. First operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 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 2140 states. [2022-04-28 15:27:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:46,485 INFO L93 Difference]: Finished difference Result 2140 states and 3054 transitions. [2022-04-28 15:27:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3054 transitions. [2022-04-28 15:27:46,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:46,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:46,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:46,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1686 states have (on average 1.435349940688019) internal successors, (2420), 1686 states have internal predecessors, (2420), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2424 transitions. [2022-04-28 15:27:46,625 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2424 transitions. Word has length 226 [2022-04-28 15:27:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:46,626 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2424 transitions. [2022-04-28 15:27:46,626 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:27:46,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1691 states and 2424 transitions. [2022-04-28 15:27:49,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2424 edges. 2424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2424 transitions. [2022-04-28 15:27:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-28 15:27:49,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:49,509 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 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, 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:27:49,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:27:49,510 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1157522256, now seen corresponding path program 1 times [2022-04-28 15:27:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:49,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387804802] [2022-04-28 15:28:02,236 WARN L232 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:28:10,724 WARN L232 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 15:28:13,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1157522256, now seen corresponding path program 2 times [2022-04-28 15:28:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:13,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66162169] [2022-04-28 15:28:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:13,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {285911#(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); {285904#true} is VALID [2022-04-28 15:28:13,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {285904#true} assume true; {285904#true} is VALID [2022-04-28 15:28:13,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {285904#true} {285904#true} #593#return; {285904#true} is VALID [2022-04-28 15:28:13,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {285904#true} call ULTIMATE.init(); {285911#(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:28:13,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {285911#(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); {285904#true} is VALID [2022-04-28 15:28:13,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {285904#true} assume true; {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285904#true} {285904#true} #593#return; {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {285904#true} call #t~ret158 := main(); {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {285904#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; {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {285904#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {285904#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {285904#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {285904#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {285904#true} is VALID [2022-04-28 15:28:13,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {285904#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {285904#true} assume 12292 == #t~mem49;havoc #t~mem49; {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {285904#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {285904#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {285904#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {285904#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {285904#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {285904#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {285904#true} assume !(0 == ~tmp___4~0); {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {285904#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {285904#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {285904#true} assume 4368 == #t~mem54;havoc #t~mem54; {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {285904#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {285904#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {285904#true} is VALID [2022-04-28 15:28:13,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {285904#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~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {285904#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {285904#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {285904#true} assume 4384 == #t~mem56;havoc #t~mem56; {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {285904#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {285904#true} is VALID [2022-04-28 15:28:13,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {285904#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {285904#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {285904#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {285904#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 55: Hoare triple {285904#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {285904#true} assume 4400 == #t~mem58;havoc #t~mem58; {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {285904#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {285904#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {285904#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {285904#true} assume !(~ret~0 <= 0); {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {285904#true} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {285904#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-28 15:28:13,269 INFO L290 TraceCheckUtils]: 77: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 78: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 79: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 80: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 83: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 86: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 87: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 88: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 89: Hoare triple {285904#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 90: Hoare triple {285904#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 91: Hoare triple {285904#true} assume 4416 == #t~mem60;havoc #t~mem60; {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {285904#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {285904#true} is VALID [2022-04-28 15:28:13,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {285904#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 94: Hoare triple {285904#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); {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 95: Hoare triple {285904#true} assume !(0 == ~tmp___6~0); {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 96: Hoare triple {285904#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 97: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 98: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 99: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 100: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,272 INFO L290 TraceCheckUtils]: 101: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 102: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 103: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 104: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 105: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 106: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 107: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 108: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,273 INFO L290 TraceCheckUtils]: 110: Hoare triple {285904#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 111: Hoare triple {285904#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 112: Hoare triple {285904#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 113: Hoare triple {285904#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 114: Hoare triple {285904#true} assume 4432 == #t~mem62;havoc #t~mem62; {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 115: Hoare triple {285904#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 116: Hoare triple {285904#true} assume !(5 == ~blastFlag~0); {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 117: Hoare triple {285904#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); {285904#true} is VALID [2022-04-28 15:28:13,274 INFO L290 TraceCheckUtils]: 118: Hoare triple {285904#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 119: Hoare triple {285904#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 120: Hoare triple {285904#true} ~skip~0 := 0; {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 121: Hoare triple {285904#true} assume !false; {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 122: Hoare triple {285904#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 123: Hoare triple {285904#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 124: Hoare triple {285904#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 125: Hoare triple {285904#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,275 INFO L290 TraceCheckUtils]: 126: Hoare triple {285904#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 127: Hoare triple {285904#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 128: Hoare triple {285904#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 129: Hoare triple {285904#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 130: Hoare triple {285904#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 131: Hoare triple {285904#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 132: Hoare triple {285904#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 133: Hoare triple {285904#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,276 INFO L290 TraceCheckUtils]: 134: Hoare triple {285904#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,277 INFO L290 TraceCheckUtils]: 135: Hoare triple {285904#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,277 INFO L290 TraceCheckUtils]: 136: Hoare triple {285904#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,277 INFO L290 TraceCheckUtils]: 137: Hoare triple {285904#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,277 INFO L290 TraceCheckUtils]: 138: Hoare triple {285904#true} assume 4448 == #t~mem64;havoc #t~mem64; {285904#true} is VALID [2022-04-28 15:28:13,277 INFO L290 TraceCheckUtils]: 139: Hoare triple {285904#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {285904#true} is VALID [2022-04-28 15:28:13,277 INFO L290 TraceCheckUtils]: 140: Hoare triple {285904#true} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem102 := read~int(#t~mem101.base, 912 + #t~mem101.offset, 4); {285904#true} is VALID [2022-04-28 15:28:13,278 INFO L290 TraceCheckUtils]: 141: Hoare triple {285904#true} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 72 + ~s.offset, 4); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,279 INFO L290 TraceCheckUtils]: 142: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,279 INFO L290 TraceCheckUtils]: 143: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,280 INFO L290 TraceCheckUtils]: 144: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,280 INFO L290 TraceCheckUtils]: 145: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} ~skip~0 := 0; {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,280 INFO L290 TraceCheckUtils]: 146: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !false; {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,281 INFO L290 TraceCheckUtils]: 147: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} is VALID [2022-04-28 15:28:13,281 INFO L290 TraceCheckUtils]: 148: Hoare triple {285909#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4480)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285910#(= |ssl3_connect_#t~mem50| 4480)} is VALID [2022-04-28 15:28:13,281 INFO L290 TraceCheckUtils]: 149: Hoare triple {285910#(= |ssl3_connect_#t~mem50| 4480)} assume 16384 == #t~mem50;havoc #t~mem50; {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 150: Hoare triple {285905#false} call write~int(0, ~s.base, 56 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 151: Hoare triple {285905#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 152: Hoare triple {285905#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 153: Hoare triple {285905#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 154: Hoare triple {285905#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 155: Hoare triple {285905#false} assume !(0 == ~tmp___4~0); {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 156: Hoare triple {285905#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,282 INFO L290 TraceCheckUtils]: 157: Hoare triple {285905#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 158: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 159: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 160: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 161: Hoare triple {285905#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 162: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 163: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 164: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,283 INFO L290 TraceCheckUtils]: 165: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 166: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 167: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 168: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 169: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 170: Hoare triple {285905#false} assume 4385 == #t~mem57;havoc #t~mem57; {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 171: Hoare triple {285905#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 172: Hoare triple {285905#false} assume !(1 == ~blastFlag~0); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 173: Hoare triple {285905#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,284 INFO L290 TraceCheckUtils]: 174: Hoare triple {285905#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 175: Hoare triple {285905#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 176: Hoare triple {285905#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 177: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 178: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 179: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 180: Hoare triple {285905#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 181: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,285 INFO L290 TraceCheckUtils]: 182: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 183: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 184: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 185: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 186: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 187: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 188: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 189: Hoare triple {285905#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 190: Hoare triple {285905#false} assume 4400 == #t~mem58;havoc #t~mem58; {285905#false} is VALID [2022-04-28 15:28:13,286 INFO L290 TraceCheckUtils]: 191: Hoare triple {285905#false} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 888 + #t~mem94.offset, 8);call #t~mem96 := read~int(#t~mem95.base, 20 + #t~mem95.offset, 8); {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 192: Hoare triple {285905#false} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 18446744073709551616);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 193: Hoare triple {285905#false} assume !(2 == ~blastFlag~0); {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 194: Hoare triple {285905#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 195: Hoare triple {285905#false} assume !(~ret~0 <= 0); {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 196: Hoare triple {285905#false} call write~int(4416, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 197: Hoare triple {285905#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 198: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-28 15:28:13,287 INFO L290 TraceCheckUtils]: 199: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 200: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 201: Hoare triple {285905#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 202: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 203: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 204: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 205: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 206: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,288 INFO L290 TraceCheckUtils]: 207: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 208: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 209: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 210: Hoare triple {285905#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 211: Hoare triple {285905#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 212: Hoare triple {285905#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 213: Hoare triple {285905#false} assume 4416 == #t~mem60;havoc #t~mem60; {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 214: Hoare triple {285905#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {285905#false} is VALID [2022-04-28 15:28:13,289 INFO L290 TraceCheckUtils]: 215: Hoare triple {285905#false} assume !(3 == ~blastFlag~0); {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 216: Hoare triple {285905#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); {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 217: Hoare triple {285905#false} assume !(0 == ~tmp___6~0); {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 218: Hoare triple {285905#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 219: Hoare triple {285905#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 220: Hoare triple {285905#false} ~skip~0 := 0; {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 221: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 222: Hoare triple {285905#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,290 INFO L290 TraceCheckUtils]: 223: Hoare triple {285905#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 224: Hoare triple {285905#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 225: Hoare triple {285905#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 226: Hoare triple {285905#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 227: Hoare triple {285905#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 228: Hoare triple {285905#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 229: Hoare triple {285905#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,291 INFO L290 TraceCheckUtils]: 230: Hoare triple {285905#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 231: Hoare triple {285905#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 232: Hoare triple {285905#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 233: Hoare triple {285905#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 234: Hoare triple {285905#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 235: Hoare triple {285905#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 236: Hoare triple {285905#false} assume 4432 == #t~mem62;havoc #t~mem62; {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 237: Hoare triple {285905#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {285905#false} is VALID [2022-04-28 15:28:13,292 INFO L290 TraceCheckUtils]: 238: Hoare triple {285905#false} assume 5 == ~blastFlag~0; {285905#false} is VALID [2022-04-28 15:28:13,293 INFO L290 TraceCheckUtils]: 239: Hoare triple {285905#false} assume !false; {285905#false} is VALID [2022-04-28 15:28:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 15:28:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:13,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66162169] [2022-04-28 15:28:13,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66162169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:13,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:13,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:13,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:13,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387804802] [2022-04-28 15:28:13,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387804802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:13,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:13,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052787123] [2022-04-28 15:28:13,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:13,295 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 240 [2022-04-28 15:28:13,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:13,296 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:28:13,398 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:28:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:13,399 INFO L87 Difference]: Start difference. First operand 1691 states and 2424 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:28:15,420 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:28:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:17,418 INFO L93 Difference]: Finished difference Result 3815 states and 5458 transitions. [2022-04-28 15:28:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:17,418 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 240 [2022-04-28 15:28:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:17,419 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:28:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:28:17,420 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:28:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:28:17,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-28 15:28:17,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:17,980 INFO L225 Difference]: With dead ends: 3815 [2022-04-28 15:28:17,981 INFO L226 Difference]: Without dead ends: 2140 [2022-04-28 15:28:17,983 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:28:17,983 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 79 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:17,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 524 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 489 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:28:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-04-28 15:28:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1769. [2022-04-28 15:28:18,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:18,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2140 states. Second operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:18,152 INFO L74 IsIncluded]: Start isIncluded. First operand 2140 states. Second operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:18,153 INFO L87 Difference]: Start difference. First operand 2140 states. Second operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:18,267 INFO L93 Difference]: Finished difference Result 2140 states and 3048 transitions. [2022-04-28 15:28:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3048 transitions. [2022-04-28 15:28:18,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:18,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:18,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 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 2140 states. [2022-04-28 15:28:18,272 INFO L87 Difference]: Start difference. First operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 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 2140 states. [2022-04-28 15:28:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:18,386 INFO L93 Difference]: Finished difference Result 2140 states and 3048 transitions. [2022-04-28 15:28:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3048 transitions. [2022-04-28 15:28:18,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:18,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:18,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:18,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1764 states have (on average 1.433106575963719) internal successors, (2528), 1764 states have internal predecessors, (2528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2532 transitions. [2022-04-28 15:28:18,529 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2532 transitions. Word has length 240 [2022-04-28 15:28:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:18,529 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2532 transitions. [2022-04-28 15:28:18,529 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:28:18,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1769 states and 2532 transitions. [2022-04-28 15:28:21,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2532 edges. 2532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2532 transitions. [2022-04-28 15:28:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-04-28 15:28:21,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:21,532 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 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, 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:28:21,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:28:21,532 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:21,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2106404142, now seen corresponding path program 1 times [2022-04-28 15:28:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:21,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076569462] [2022-04-28 15:28:49,554 WARN L232 SmtUtils]: Spent 22.76s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)