/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_srvr.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:15:50,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:15:50,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:15:50,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:15:50,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:15:50,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:15:50,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:15:50,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:15:50,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:15:50,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:15:50,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:15:50,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:15:50,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:15:50,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:15:50,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:15:50,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:15:50,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:15:50,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:15:50,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:15:50,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:15:50,287 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:15:50,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:15:50,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:15:50,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:15:50,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:15:50,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:15:50,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:15:50,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:15:50,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:15:50,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:15:50,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:15:50,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:15:50,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:15:50,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:15:50,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:15:50,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:15:50,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:15:50,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:15:50,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:15:50,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:15:50,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:15:50,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:15:50,313 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:50,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:15:50,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:15:50,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:15:50,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:15:50,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:15:50,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:15:50,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:15:50,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:15:50,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:15:50,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:15:50,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:15:50,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:15:50,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:15:50,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:15:50,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:15:50,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:15:50,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:15:50,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:15:50,324 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:15:50,324 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:15:50,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:15:50,325 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:15:50,325 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:50,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:15:50,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:15:50,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:15:50,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:15:50,596 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:15:50,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-28 15:15:50,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fa09360/0c66e78a13ba44cbacbabcc9efbd9907/FLAG4797c73a3 [2022-04-28 15:15:51,195 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:15:51,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-28 15:15:51,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fa09360/0c66e78a13ba44cbacbabcc9efbd9907/FLAG4797c73a3 [2022-04-28 15:15:51,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fa09360/0c66e78a13ba44cbacbabcc9efbd9907 [2022-04-28 15:15:51,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:15:51,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:15:51,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:15:51,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:15:51,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:15:51,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:51" (1/1) ... [2022-04-28 15:15:51,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa13c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:51, skipping insertion in model container [2022-04-28 15:15:51,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:51" (1/1) ... [2022-04-28 15:15:51,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:15:51,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:15:52,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-28 15:15:52,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:15:52,369 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:15:52,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-28 15:15:52,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:15:52,549 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:15:52,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:52 WrapperNode [2022-04-28 15:15:52,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:15:52,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:15:52,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:15:52,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:15:52,561 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:52" (1/1) ... [2022-04-28 15:15:52,561 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:52" (1/1) ... [2022-04-28 15:15:52,593 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:52" (1/1) ... [2022-04-28 15:15:52,594 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:52" (1/1) ... [2022-04-28 15:15:52,654 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:52" (1/1) ... [2022-04-28 15:15:52,661 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:52" (1/1) ... [2022-04-28 15:15:52,664 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:52" (1/1) ... [2022-04-28 15:15:52,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:15:52,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:15:52,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:15:52,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:15:52,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:52" (1/1) ... [2022-04-28 15:15:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:15:52,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:15:52,709 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:52,732 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:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:15:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:15:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:15:52,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:15:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:15:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:15:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:15:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:15:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:15:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:15:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:15:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:15:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:15:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:15:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:15:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:15:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:15:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:15:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:15:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:15:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:15:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:15:52,947 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:15:52,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:15:54,619 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:15:55,195 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:15:55,195 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:15:55,213 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:15:55,225 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:15:55,225 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:15:55,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:15:55 BoogieIcfgContainer [2022-04-28 15:15:55,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:15:55,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:15:55,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:15:55,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:15:55,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:15:51" (1/3) ... [2022-04-28 15:15:55,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735d25fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:15:55, skipping insertion in model container [2022-04-28 15:15:55,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:52" (2/3) ... [2022-04-28 15:15:55,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735d25fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:15:55, skipping insertion in model container [2022-04-28 15:15:55,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:15:55" (3/3) ... [2022-04-28 15:15:55,237 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-28 15:15:55,250 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:15:55,250 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:15:55,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:15:55,312 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@6b6dffc0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58073171 [2022-04-28 15:15:55,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:15:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 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:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 15:15:55,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:15:55,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:15:55,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:15:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:15:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-28 15:15:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:55,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869168474] [2022-04-28 15:15:55,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:15:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 2 times [2022-04-28 15:15:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:15:55,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149384730] [2022-04-28 15:15:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:15:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:15:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:15:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:15:55,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-28 15:15:55,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-28 15:15:55,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-28 15:15:55,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:15:55,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158#true} is VALID [2022-04-28 15:15:55,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-28 15:15:55,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-28 15:15:55,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-28 15:15:55,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-28 15:15:55,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {158#true} is VALID [2022-04-28 15:15:55,942 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-28 15:15:55,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:15:55,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-28 15:15:55,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-28 15:15:55,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-28 15:15:55,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-28 15:15:55,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-28 15:15:55,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-28 15:15:55,977 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:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:15:55,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149384730] [2022-04-28 15:15:55,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149384730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:55,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:55,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:55,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:15:55,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869168474] [2022-04-28 15:15:55,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869168474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:15:55,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:15:55,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:15:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232947761] [2022-04-28 15:15:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:15:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 15:15:55,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:15:55,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:56,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:15:56,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:15:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:15:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:15:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:15:56,086 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:58,132 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:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:15:59,765 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-28 15:15:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:15:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 15:15:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:15:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-28 15:15:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:15:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-28 15:15:59,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-28 15:16:00,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:00,253 INFO L225 Difference]: With dead ends: 328 [2022-04-28 15:16:00,253 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 15:16:00,256 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:00,263 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:00,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:16:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 15:16:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-28 15:16:00,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:00,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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:00,318 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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:00,319 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:00,329 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-28 15:16:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-28 15:16:00,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:00,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:00,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 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 167 states. [2022-04-28 15:16:00,338 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 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 167 states. [2022-04-28 15:16:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:00,347 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-28 15:16:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-28 15:16:00,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:00,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:00,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:00,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call 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:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-28 15:16:00,357 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-28 15:16:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:00,358 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-28 15:16:00,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:00,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 227 transitions. [2022-04-28 15:16:00,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-28 15:16:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:16:00,551 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:00,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:00,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:16:00,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-28 15:16:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46556861] [2022-04-28 15:16:00,579 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:00,580 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 2 times [2022-04-28 15:16:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:00,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472362074] [2022-04-28 15:16:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:00,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:00,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1460#true} is VALID [2022-04-28 15:16:00,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-28 15:16:00,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-28 15:16:00,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:00,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1460#true} is VALID [2022-04-28 15:16:00,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-28 15:16:00,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-28 15:16:00,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {1460#true} call #t~ret162 := main(); {1460#true} is VALID [2022-04-28 15:16:00,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {1460#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1460#true} is VALID [2022-04-28 15:16:00,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {1460#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1460#true} is VALID [2022-04-28 15:16:00,849 INFO L272 TraceCheckUtils]: 7: Hoare triple {1460#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1460#true} is VALID [2022-04-28 15:16:00,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:00,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1466#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-28 15:16:00,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#(= 8464 |ssl3_accept_#t~mem47|)} assume 8480 == #t~mem47;havoc #t~mem47; {1461#false} is VALID [2022-04-28 15:16:00,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {1461#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1461#false} is VALID [2022-04-28 15:16:00,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {1461#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1461#false} is VALID [2022-04-28 15:16:00,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#false} ~skip~0 := 0; {1461#false} is VALID [2022-04-28 15:16:00,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-28 15:16:00,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {1461#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {1461#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {1461#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {1461#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {1461#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {1461#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {1461#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {1461#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {1461#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {1461#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {1461#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {1461#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {1461#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {1461#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {1461#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {1461#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {1461#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {1461#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {1461#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {1461#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {1461#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {1461#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {1461#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {1461#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {1461#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {1461#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {1461#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-28 15:16:00,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {1461#false} assume 8672 == #t~mem74;havoc #t~mem74; {1461#false} is VALID [2022-04-28 15:16:00,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {1461#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1461#false} is VALID [2022-04-28 15:16:00,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {1461#false} assume 4 == ~blastFlag~0; {1461#false} is VALID [2022-04-28 15:16:00,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-28 15:16:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:00,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472362074] [2022-04-28 15:16:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472362074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:00,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46556861] [2022-04-28 15:16:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46556861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109472448] [2022-04-28 15:16:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:16:00,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:00,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:00,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:00,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:00,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:00,936 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:02,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:04,096 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2022-04-28 15:16:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:04,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:16:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-28 15:16:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-28 15:16:04,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-28 15:16:04,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:04,463 INFO L225 Difference]: With dead ends: 291 [2022-04-28 15:16:04,463 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 15:16:04,464 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:04,465 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:04,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 462 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:16:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 15:16:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-28 15:16:04,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:04,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call 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,476 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call 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,477 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call 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,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:04,482 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-28 15:16:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-28 15:16:04,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:04,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:04,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 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 167 states. [2022-04-28 15:16:04,484 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 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 167 states. [2022-04-28 15:16:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:04,489 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-28 15:16:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-28 15:16:04,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:04,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:04,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:04,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call 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,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2022-04-28 15:16:04,496 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 65 [2022-04-28 15:16:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:04,496 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2022-04-28 15:16:04,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:04,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 226 transitions. [2022-04-28 15:16:04,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2022-04-28 15:16:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:04,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:04,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:04,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:16:04,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-28 15:16:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:04,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285746026] [2022-04-28 15:16:04,701 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:04,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 2 times [2022-04-28 15:16:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:04,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024562454] [2022-04-28 15:16:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:04,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2688#true} is VALID [2022-04-28 15:16:04,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-28 15:16:04,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-28 15:16:04,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {2688#true} call ULTIMATE.init(); {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:04,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2688#true} is VALID [2022-04-28 15:16:04,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-28 15:16:04,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-28 15:16:04,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret162 := main(); {2688#true} is VALID [2022-04-28 15:16:04,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {2688#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2688#true} is VALID [2022-04-28 15:16:04,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {2688#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2688#true} is VALID [2022-04-28 15:16:04,863 INFO L272 TraceCheckUtils]: 7: Hoare triple {2688#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2688#true} is VALID [2022-04-28 15:16:04,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:04,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2694#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-28 15:16:04,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(= 8464 |ssl3_accept_#t~mem48|)} assume 8481 == #t~mem48;havoc #t~mem48; {2689#false} is VALID [2022-04-28 15:16:04,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2689#false} is VALID [2022-04-28 15:16:04,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {2689#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {2689#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {2689#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2689#false} is VALID [2022-04-28 15:16:04,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#false} ~skip~0 := 0; {2689#false} is VALID [2022-04-28 15:16:04,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-28 15:16:04,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {2689#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {2689#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {2689#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {2689#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {2689#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {2689#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {2689#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {2689#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {2689#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {2689#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {2689#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {2689#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {2689#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {2689#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {2689#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {2689#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {2689#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {2689#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {2689#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {2689#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {2689#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {2689#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {2689#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {2689#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 55: Hoare triple {2689#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {2689#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {2689#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {2689#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {2689#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {2689#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-28 15:16:04,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {2689#false} assume 8672 == #t~mem74;havoc #t~mem74; {2689#false} is VALID [2022-04-28 15:16:04,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {2689#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2689#false} is VALID [2022-04-28 15:16:04,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {2689#false} assume 4 == ~blastFlag~0; {2689#false} is VALID [2022-04-28 15:16:04,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-28 15:16:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024562454] [2022-04-28 15:16:04,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024562454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:04,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:04,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:04,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:04,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285746026] [2022-04-28 15:16:04,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285746026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:04,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:04,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664142890] [2022-04-28 15:16:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:16:04,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:04,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:04,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:04,965 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:06,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:08,034 INFO L93 Difference]: Finished difference Result 289 states and 434 transitions. [2022-04-28 15:16:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:16:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:16:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:16:08,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-28 15:16:08,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:08,414 INFO L225 Difference]: With dead ends: 289 [2022-04-28 15:16:08,414 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:16:08,415 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:08,415 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:08,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 466 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:16:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:16:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2022-04-28 15:16:08,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:08,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call 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,425 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call 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,425 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call 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,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:08,429 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:16:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:16:08,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:08,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:08,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-28 15:16:08,431 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-28 15:16:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:08,435 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:16:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:16:08,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:08,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:08,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:08,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call 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,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2022-04-28 15:16:08,440 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 66 [2022-04-28 15:16:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:08,440 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2022-04-28 15:16:08,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:08,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 225 transitions. [2022-04-28 15:16:08,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2022-04-28 15:16:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:16:08,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:08,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:08,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:16:08,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:08,614 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-28 15:16:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:08,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1327940602] [2022-04-28 15:16:08,630 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:08,630 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 2 times [2022-04-28 15:16:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:08,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235840600] [2022-04-28 15:16:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:08,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {3915#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3908#true} is VALID [2022-04-28 15:16:08,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {3908#true} assume true; {3908#true} is VALID [2022-04-28 15:16:08,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3908#true} {3908#true} #664#return; {3908#true} is VALID [2022-04-28 15:16:08,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {3908#true} call ULTIMATE.init(); {3915#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:08,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {3915#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3908#true} is VALID [2022-04-28 15:16:08,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {3908#true} assume true; {3908#true} is VALID [2022-04-28 15:16:08,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3908#true} {3908#true} #664#return; {3908#true} is VALID [2022-04-28 15:16:08,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {3908#true} call #t~ret162 := main(); {3908#true} is VALID [2022-04-28 15:16:08,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {3908#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3908#true} is VALID [2022-04-28 15:16:08,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {3908#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3908#true} is VALID [2022-04-28 15:16:08,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {3908#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3908#true} is VALID [2022-04-28 15:16:08,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {3908#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:08,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3914#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-28 15:16:08,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {3914#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {3909#false} is VALID [2022-04-28 15:16:08,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {3909#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {3909#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {3909#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {3909#false} is VALID [2022-04-28 15:16:08,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {3909#false} ~skip~0 := 0; {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {3909#false} assume !false; {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {3909#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {3909#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {3909#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {3909#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {3909#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {3909#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {3909#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {3909#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {3909#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {3909#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {3909#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {3909#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {3909#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {3909#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {3909#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {3909#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {3909#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {3909#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {3909#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {3909#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {3909#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {3909#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {3909#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {3909#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {3909#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {3909#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {3909#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {3909#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {3909#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {3909#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {3909#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {3909#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {3909#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {3909#false} assume 8672 == #t~mem74;havoc #t~mem74; {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {3909#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {3909#false} assume 4 == ~blastFlag~0; {3909#false} is VALID [2022-04-28 15:16:08,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {3909#false} assume !false; {3909#false} is VALID [2022-04-28 15:16:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235840600] [2022-04-28 15:16:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235840600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:08,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1327940602] [2022-04-28 15:16:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1327940602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:08,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:08,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062974793] [2022-04-28 15:16:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:08,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:16:08,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:08,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:08,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:08,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:08,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:08,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:08,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:08,839 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:12,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:14,481 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:16,515 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:16:18,538 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:16:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:19,557 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2022-04-28 15:16:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:16:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 15:16:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 15:16:19,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-28 15:16:19,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:19,855 INFO L225 Difference]: With dead ends: 288 [2022-04-28 15:16:19,856 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:16:19,856 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:19,857 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:19,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-04-28 15:16:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:16:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-04-28 15:16:19,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:19,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,865 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,866 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:19,870 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:16:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:16:19,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:19,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:19,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:16:19,871 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:16:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:19,875 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:16:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:16:19,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:19,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:19,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:19,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2022-04-28 15:16:19,881 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 66 [2022-04-28 15:16:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:19,882 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2022-04-28 15:16:19,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:19,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 224 transitions. [2022-04-28 15:16:20,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2022-04-28 15:16:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:16:20,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:20,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:20,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:16:20,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-28 15:16:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:20,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642086821] [2022-04-28 15:16:20,076 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:20,076 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 2 times [2022-04-28 15:16:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:20,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467114116] [2022-04-28 15:16:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:20,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {5131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5124#true} is VALID [2022-04-28 15:16:20,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {5124#true} assume true; {5124#true} is VALID [2022-04-28 15:16:20,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5124#true} {5124#true} #664#return; {5124#true} is VALID [2022-04-28 15:16:20,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {5124#true} call ULTIMATE.init(); {5131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:20,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {5131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5124#true} is VALID [2022-04-28 15:16:20,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {5124#true} assume true; {5124#true} is VALID [2022-04-28 15:16:20,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5124#true} {5124#true} #664#return; {5124#true} is VALID [2022-04-28 15:16:20,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {5124#true} call #t~ret162 := main(); {5124#true} is VALID [2022-04-28 15:16:20,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {5124#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5124#true} is VALID [2022-04-28 15:16:20,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {5124#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5124#true} is VALID [2022-04-28 15:16:20,246 INFO L272 TraceCheckUtils]: 7: Hoare triple {5124#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5124#true} is VALID [2022-04-28 15:16:20,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {5124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:20,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {5130#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-28 15:16:20,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {5130#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {5125#false} is VALID [2022-04-28 15:16:20,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {5125#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {5125#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {5125#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5125#false} is VALID [2022-04-28 15:16:20,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {5125#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {5125#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5125#false} is VALID [2022-04-28 15:16:20,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {5125#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {5125#false} is VALID [2022-04-28 15:16:20,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {5125#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5125#false} is VALID [2022-04-28 15:16:20,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {5125#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {5125#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {5125#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {5125#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {5125#false} ~skip~0 := 0; {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {5125#false} assume !false; {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {5125#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {5125#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {5125#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {5125#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {5125#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {5125#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {5125#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {5125#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {5125#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {5125#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {5125#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {5125#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {5125#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {5125#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {5125#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {5125#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {5125#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {5125#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {5125#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {5125#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {5125#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {5125#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {5125#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {5125#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {5125#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {5125#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {5125#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {5125#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {5125#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {5125#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {5125#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {5125#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 62: Hoare triple {5125#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 63: Hoare triple {5125#false} assume 8672 == #t~mem74;havoc #t~mem74; {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 64: Hoare triple {5125#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5125#false} is VALID [2022-04-28 15:16:20,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {5125#false} assume 4 == ~blastFlag~0; {5125#false} is VALID [2022-04-28 15:16:20,260 INFO L290 TraceCheckUtils]: 66: Hoare triple {5125#false} assume !false; {5125#false} is VALID [2022-04-28 15:16:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:20,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467114116] [2022-04-28 15:16:20,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467114116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:20,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:20,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:20,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:20,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642086821] [2022-04-28 15:16:20,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642086821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:20,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:20,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906850573] [2022-04-28 15:16:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:20,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:16:20,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:20,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:20,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:20,326 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:22,352 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:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:23,383 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2022-04-28 15:16:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:23,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:16:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-28 15:16:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-28 15:16:23,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-28 15:16:23,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:23,707 INFO L225 Difference]: With dead ends: 287 [2022-04-28 15:16:23,708 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 15:16:23,708 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:23,709 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:23,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:16:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 15:16:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-28 15:16:23,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:23,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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:23,717 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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:23,718 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:23,720 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2022-04-28 15:16:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-04-28 15:16:23,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:23,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:23,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 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 163 states. [2022-04-28 15:16:23,722 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 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 163 states. [2022-04-28 15:16:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:23,725 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2022-04-28 15:16:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-04-28 15:16:23,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:23,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:23,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:23,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2022-04-28 15:16:23,729 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 67 [2022-04-28 15:16:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:23,729 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2022-04-28 15:16:23,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:23,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 223 transitions. [2022-04-28 15:16:23,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2022-04-28 15:16:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:16:23,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:23,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:23,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:16:23,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-28 15:16:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:23,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2072329756] [2022-04-28 15:16:23,925 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:23,925 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 2 times [2022-04-28 15:16:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:23,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341954118] [2022-04-28 15:16:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:24,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {6343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6336#true} is VALID [2022-04-28 15:16:24,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {6336#true} assume true; {6336#true} is VALID [2022-04-28 15:16:24,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6336#true} {6336#true} #664#return; {6336#true} is VALID [2022-04-28 15:16:24,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {6336#true} call ULTIMATE.init(); {6343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:24,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6336#true} is VALID [2022-04-28 15:16:24,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2022-04-28 15:16:24,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6336#true} #664#return; {6336#true} is VALID [2022-04-28 15:16:24,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {6336#true} call #t~ret162 := main(); {6336#true} is VALID [2022-04-28 15:16:24,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {6336#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6336#true} is VALID [2022-04-28 15:16:24,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {6336#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {6336#true} is VALID [2022-04-28 15:16:24,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {6336#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6336#true} is VALID [2022-04-28 15:16:24,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {6336#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:24,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {6342#(= 8464 |ssl3_accept_#t~mem43|)} is VALID [2022-04-28 15:16:24,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {6342#(= 8464 |ssl3_accept_#t~mem43|)} assume 16384 == #t~mem43;havoc #t~mem43; {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {6337#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {6337#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {6337#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {6337#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {6337#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {6337#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {6337#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {6337#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {6337#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {6337#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {6337#false} ~skip~0 := 0; {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {6337#false} assume !false; {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {6337#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {6337#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {6337#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {6337#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {6337#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {6337#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {6337#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {6337#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {6337#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {6337#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {6337#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {6337#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {6337#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {6337#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {6337#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {6337#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {6337#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {6337#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {6337#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {6337#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {6337#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {6337#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {6337#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {6337#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {6337#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {6337#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {6337#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {6337#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {6337#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {6337#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {6337#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {6337#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {6337#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {6337#false} assume 8672 == #t~mem74;havoc #t~mem74; {6337#false} is VALID [2022-04-28 15:16:24,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {6337#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {6337#false} is VALID [2022-04-28 15:16:24,059 INFO L290 TraceCheckUtils]: 65: Hoare triple {6337#false} assume 4 == ~blastFlag~0; {6337#false} is VALID [2022-04-28 15:16:24,059 INFO L290 TraceCheckUtils]: 66: Hoare triple {6337#false} assume !false; {6337#false} is VALID [2022-04-28 15:16:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341954118] [2022-04-28 15:16:24,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341954118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:24,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:24,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:24,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:24,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2072329756] [2022-04-28 15:16:24,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2072329756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:24,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:24,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:24,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401700213] [2022-04-28 15:16:24,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:24,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:16:24,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:24,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:24,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:24,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:24,124 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:26,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:16:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:27,197 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2022-04-28 15:16:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:27,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 15:16:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:16:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:16:27,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-28 15:16:27,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:27,495 INFO L225 Difference]: With dead ends: 287 [2022-04-28 15:16:27,495 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 15:16:27,495 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:27,496 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:27,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:16:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 15:16:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-28 15:16:27,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:27,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,510 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,511 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:27,514 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2022-04-28 15:16:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2022-04-28 15:16:27,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:27,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:27,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-28 15:16:27,515 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 163 states. [2022-04-28 15:16:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:27,518 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2022-04-28 15:16:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2022-04-28 15:16:27,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:27,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:27,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:27,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2022-04-28 15:16:27,522 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 67 [2022-04-28 15:16:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:27,523 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-04-28 15:16:27,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 222 transitions. [2022-04-28 15:16:27,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2022-04-28 15:16:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 15:16:27,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:27,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:27,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:16:27,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:27,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:27,705 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-28 15:16:27,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:27,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821469156] [2022-04-28 15:16:27,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:27,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 2 times [2022-04-28 15:16:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:27,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471239867] [2022-04-28 15:16:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:27,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:27,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {7555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7548#true} is VALID [2022-04-28 15:16:27,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {7548#true} assume true; {7548#true} is VALID [2022-04-28 15:16:27,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7548#true} {7548#true} #664#return; {7548#true} is VALID [2022-04-28 15:16:27,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {7548#true} call ULTIMATE.init(); {7555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:27,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {7555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7548#true} is VALID [2022-04-28 15:16:27,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {7548#true} assume true; {7548#true} is VALID [2022-04-28 15:16:27,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7548#true} {7548#true} #664#return; {7548#true} is VALID [2022-04-28 15:16:27,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {7548#true} call #t~ret162 := main(); {7548#true} is VALID [2022-04-28 15:16:27,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {7548#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7548#true} is VALID [2022-04-28 15:16:27,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {7548#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7548#true} is VALID [2022-04-28 15:16:27,896 INFO L272 TraceCheckUtils]: 7: Hoare triple {7548#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7548#true} is VALID [2022-04-28 15:16:27,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {7548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:27,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7554#(= 8464 |ssl3_accept_#t~mem44|)} is VALID [2022-04-28 15:16:27,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {7554#(= 8464 |ssl3_accept_#t~mem44|)} assume 8192 == #t~mem44;havoc #t~mem44; {7549#false} is VALID [2022-04-28 15:16:27,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {7549#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {7549#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7549#false} is VALID [2022-04-28 15:16:27,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {7549#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {7549#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {7549#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {7549#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {7549#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {7549#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {7549#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {7549#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {7549#false} ~skip~0 := 0; {7549#false} is VALID [2022-04-28 15:16:27,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {7549#false} assume !false; {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {7549#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {7549#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {7549#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {7549#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {7549#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {7549#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {7549#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {7549#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {7549#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {7549#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {7549#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {7549#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {7549#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {7549#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {7549#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {7549#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {7549#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {7549#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {7549#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {7549#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {7549#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {7549#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {7549#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {7549#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {7549#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {7549#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {7549#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {7549#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {7549#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {7549#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {7549#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {7549#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,909 INFO L290 TraceCheckUtils]: 63: Hoare triple {7549#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-28 15:16:27,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {7549#false} assume 8672 == #t~mem74;havoc #t~mem74; {7549#false} is VALID [2022-04-28 15:16:27,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {7549#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {7549#false} is VALID [2022-04-28 15:16:27,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {7549#false} assume 4 == ~blastFlag~0; {7549#false} is VALID [2022-04-28 15:16:27,910 INFO L290 TraceCheckUtils]: 67: Hoare triple {7549#false} assume !false; {7549#false} is VALID [2022-04-28 15:16:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:27,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471239867] [2022-04-28 15:16:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471239867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:27,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:27,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:27,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821469156] [2022-04-28 15:16:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821469156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:27,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831903872] [2022-04-28 15:16:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 15:16:27,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:27,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:27,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:27,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:27,969 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:29,989 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:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:30,956 INFO L93 Difference]: Finished difference Result 287 states and 428 transitions. [2022-04-28 15:16:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 15:16:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:16:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:16:30,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-28 15:16:31,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:31,328 INFO L225 Difference]: With dead ends: 287 [2022-04-28 15:16:31,328 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 15:16:31,329 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:31,329 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:31,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 15:16:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-28 15:16:31,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:31,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:31,335 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:31,336 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:31,338 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2022-04-28 15:16:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2022-04-28 15:16:31,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:31,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:31,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 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 163 states. [2022-04-28 15:16:31,340 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 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 163 states. [2022-04-28 15:16:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:31,343 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2022-04-28 15:16:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2022-04-28 15:16:31,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:31,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:31,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:31,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call 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:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2022-04-28 15:16:31,347 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 68 [2022-04-28 15:16:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:31,347 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2022-04-28 15:16:31,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:31,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 221 transitions. [2022-04-28 15:16:31,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2022-04-28 15:16:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:16:31,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:31,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:31,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:16:31,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:31,531 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-28 15:16:31,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:31,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567067114] [2022-04-28 15:16:31,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:31,555 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 2 times [2022-04-28 15:16:31,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:31,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094043407] [2022-04-28 15:16:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:31,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {8767#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8760#true} is VALID [2022-04-28 15:16:31,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {8760#true} assume true; {8760#true} is VALID [2022-04-28 15:16:31,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8760#true} {8760#true} #664#return; {8760#true} is VALID [2022-04-28 15:16:31,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {8760#true} call ULTIMATE.init(); {8767#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:31,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {8767#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8760#true} is VALID [2022-04-28 15:16:31,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {8760#true} assume true; {8760#true} is VALID [2022-04-28 15:16:31,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8760#true} {8760#true} #664#return; {8760#true} is VALID [2022-04-28 15:16:31,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {8760#true} call #t~ret162 := main(); {8760#true} is VALID [2022-04-28 15:16:31,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {8760#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8760#true} is VALID [2022-04-28 15:16:31,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {8760#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {8760#true} is VALID [2022-04-28 15:16:31,737 INFO L272 TraceCheckUtils]: 7: Hoare triple {8760#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8760#true} is VALID [2022-04-28 15:16:31,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {8760#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:16:31,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {8766#(not (= 24576 |ssl3_accept_#t~mem45|))} is VALID [2022-04-28 15:16:31,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {8766#(not (= 24576 |ssl3_accept_#t~mem45|))} assume 24576 == #t~mem45;havoc #t~mem45; {8761#false} is VALID [2022-04-28 15:16:31,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {8761#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {8761#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8761#false} is VALID [2022-04-28 15:16:31,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {8761#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {8761#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8761#false} is VALID [2022-04-28 15:16:31,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {8761#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {8761#false} is VALID [2022-04-28 15:16:31,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {8761#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {8761#false} is VALID [2022-04-28 15:16:31,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {8761#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {8761#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {8761#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {8761#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {8761#false} is VALID [2022-04-28 15:16:31,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {8761#false} ~skip~0 := 0; {8761#false} is VALID [2022-04-28 15:16:31,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {8761#false} assume !false; {8761#false} is VALID [2022-04-28 15:16:31,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {8761#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {8761#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {8761#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {8761#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {8761#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {8761#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {8761#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {8761#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {8761#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {8761#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {8761#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 43: Hoare triple {8761#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {8761#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {8761#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {8761#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {8761#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {8761#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {8761#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {8761#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {8761#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {8761#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {8761#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {8761#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 55: Hoare triple {8761#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {8761#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {8761#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 58: Hoare triple {8761#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 59: Hoare triple {8761#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,754 INFO L290 TraceCheckUtils]: 60: Hoare triple {8761#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {8761#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 62: Hoare triple {8761#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 63: Hoare triple {8761#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 64: Hoare triple {8761#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {8761#false} assume 8672 == #t~mem74;havoc #t~mem74; {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {8761#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {8761#false} assume 4 == ~blastFlag~0; {8761#false} is VALID [2022-04-28 15:16:31,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {8761#false} assume !false; {8761#false} is VALID [2022-04-28 15:16:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094043407] [2022-04-28 15:16:31,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094043407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:31,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:31,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:31,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:31,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567067114] [2022-04-28 15:16:31,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567067114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:31,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:31,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401121455] [2022-04-28 15:16:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:31,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:16:31,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:31,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:31,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:31,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:31,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:31,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:31,815 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:33,836 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:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:35,217 INFO L93 Difference]: Finished difference Result 390 states and 589 transitions. [2022-04-28 15:16:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:16:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-28 15:16:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-28 15:16:35,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-28 15:16:35,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:35,714 INFO L225 Difference]: With dead ends: 390 [2022-04-28 15:16:35,714 INFO L226 Difference]: Without dead ends: 266 [2022-04-28 15:16:35,715 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:35,715 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:35,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:16:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-28 15:16:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 164. [2022-04-28 15:16:35,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:35,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call 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:35,723 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call 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:35,723 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call 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:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:35,729 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-04-28 15:16:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2022-04-28 15:16:35,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:35,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:35,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 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 266 states. [2022-04-28 15:16:35,739 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 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 266 states. [2022-04-28 15:16:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:35,754 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-04-28 15:16:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2022-04-28 15:16:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:35,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:35,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:35,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call 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:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2022-04-28 15:16:35,759 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 69 [2022-04-28 15:16:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:35,759 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2022-04-28 15:16:35,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:35,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 242 transitions. [2022-04-28 15:16:35,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:16:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:16:35,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:35,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:35,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:16:35,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:35,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:35,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-28 15:16:35,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:35,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852992202] [2022-04-28 15:16:35,989 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:35,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 2 times [2022-04-28 15:16:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:35,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388350258] [2022-04-28 15:16:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:36,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {10419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10412#true} is VALID [2022-04-28 15:16:36,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {10412#true} assume true; {10412#true} is VALID [2022-04-28 15:16:36,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10412#true} {10412#true} #664#return; {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {10412#true} call ULTIMATE.init(); {10419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:36,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {10419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {10412#true} assume true; {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10412#true} {10412#true} #664#return; {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {10412#true} call #t~ret162 := main(); {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {10412#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {10412#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L272 TraceCheckUtils]: 7: Hoare triple {10412#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10412#true} is VALID [2022-04-28 15:16:36,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {10412#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {10412#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {10412#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {10412#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {10412#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {10412#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {10412#true} assume !false; {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {10412#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {10412#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {10412#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {10412#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {10412#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {10412#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {10412#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {10412#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {10412#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {10412#true} assume 8464 == #t~mem50;havoc #t~mem50; {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {10412#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; {10412#true} is VALID [2022-04-28 15:16:36,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {10412#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10412#true} is VALID [2022-04-28 15:16:36,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {10412#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:36,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {10418#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {10418#(= |ssl3_accept_#t~mem53| 8496)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {10413#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {10413#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {10413#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {10413#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {10413#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {10413#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {10413#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {10413#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {10413#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {10413#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {10413#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {10413#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {10413#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {10413#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {10413#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {10413#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {10413#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {10413#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {10413#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {10413#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {10413#false} assume 8672 == #t~mem74;havoc #t~mem74; {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {10413#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 67: Hoare triple {10413#false} assume 4 == ~blastFlag~0; {10413#false} is VALID [2022-04-28 15:16:36,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {10413#false} assume !false; {10413#false} is VALID [2022-04-28 15:16:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:36,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:36,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388350258] [2022-04-28 15:16:36,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388350258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:36,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:36,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:36,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:36,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852992202] [2022-04-28 15:16:36,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852992202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:36,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:36,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:36,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973666950] [2022-04-28 15:16:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:16:36,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:36,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:36,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:36,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:36,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:36,217 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:38,242 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:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:39,339 INFO L93 Difference]: Finished difference Result 345 states and 518 transitions. [2022-04-28 15:16:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 15:16:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 15:16:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-28 15:16:39,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-28 15:16:39,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:39,674 INFO L225 Difference]: With dead ends: 345 [2022-04-28 15:16:39,675 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 15:16:39,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:16:39,676 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 33 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:39,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 510 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:16:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 15:16:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2022-04-28 15:16:39,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:39,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call 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,683 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call 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,684 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call 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,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:39,687 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2022-04-28 15:16:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 306 transitions. [2022-04-28 15:16:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:39,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 states have internal predecessors, (275), 3 states have call successors, (3), 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 207 states. [2022-04-28 15:16:39,689 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 states have internal predecessors, (275), 3 states have call successors, (3), 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 207 states. [2022-04-28 15:16:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:39,693 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2022-04-28 15:16:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 306 transitions. [2022-04-28 15:16:39,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:39,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:39,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:39,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call 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,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 279 transitions. [2022-04-28 15:16:39,697 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 279 transitions. Word has length 69 [2022-04-28 15:16:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:39,698 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 279 transitions. [2022-04-28 15:16:39,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:39,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 279 transitions. [2022-04-28 15:16:39,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 279 transitions. [2022-04-28 15:16:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 15:16:39,903 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:39,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:39,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:16:39,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1106801116, now seen corresponding path program 1 times [2022-04-28 15:16:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:39,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [77630519] [2022-04-28 15:16:39,928 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:16:39,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1106801116, now seen corresponding path program 2 times [2022-04-28 15:16:39,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:39,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621651490] [2022-04-28 15:16:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:40,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {11907#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11900#true} is VALID [2022-04-28 15:16:40,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {11900#true} assume true; {11900#true} is VALID [2022-04-28 15:16:40,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11900#true} {11900#true} #664#return; {11900#true} is VALID [2022-04-28 15:16:40,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {11900#true} call ULTIMATE.init(); {11907#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:40,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {11907#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11900#true} is VALID [2022-04-28 15:16:40,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {11900#true} assume true; {11900#true} is VALID [2022-04-28 15:16:40,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11900#true} {11900#true} #664#return; {11900#true} is VALID [2022-04-28 15:16:40,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {11900#true} call #t~ret162 := main(); {11900#true} is VALID [2022-04-28 15:16:40,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {11900#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11900#true} is VALID [2022-04-28 15:16:40,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {11900#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {11900#true} is VALID [2022-04-28 15:16:40,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {11900#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11900#true} is VALID [2022-04-28 15:16:40,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {11900#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:40,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11906#(= 8464 |ssl3_accept_#t~mem46|)} is VALID [2022-04-28 15:16:40,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {11906#(= 8464 |ssl3_accept_#t~mem46|)} assume 8195 == #t~mem46;havoc #t~mem46; {11901#false} is VALID [2022-04-28 15:16:40,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {11901#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {11901#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11901#false} is VALID [2022-04-28 15:16:40,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {11901#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {11901#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {11901#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {11901#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {11901#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {11901#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {11901#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {11901#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {11901#false} ~skip~0 := 0; {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {11901#false} assume !false; {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {11901#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {11901#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {11901#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {11901#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {11901#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {11901#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {11901#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {11901#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {11901#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {11901#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {11901#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {11901#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {11901#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {11901#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {11901#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {11901#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {11901#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {11901#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {11901#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {11901#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {11901#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {11901#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {11901#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {11901#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {11901#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {11901#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {11901#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {11901#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {11901#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 62: Hoare triple {11901#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {11901#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 64: Hoare triple {11901#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {11901#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-28 15:16:40,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {11901#false} assume 8672 == #t~mem74;havoc #t~mem74; {11901#false} is VALID [2022-04-28 15:16:40,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {11901#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {11901#false} is VALID [2022-04-28 15:16:40,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {11901#false} assume 4 == ~blastFlag~0; {11901#false} is VALID [2022-04-28 15:16:40,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {11901#false} assume !false; {11901#false} is VALID [2022-04-28 15:16:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:40,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:40,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621651490] [2022-04-28 15:16:40,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621651490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:40,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:40,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:40,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:40,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [77630519] [2022-04-28 15:16:40,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [77630519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:40,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:40,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775243394] [2022-04-28 15:16:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:40,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 15:16:40,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:40,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:40,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:40,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:40,160 INFO L87 Difference]: Start difference. First operand 186 states and 279 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:42,185 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:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,051 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2022-04-28 15:16:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:43,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 15:16:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2022-04-28 15:16:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2022-04-28 15:16:43,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 413 transitions. [2022-04-28 15:16:43,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:43,343 INFO L225 Difference]: With dead ends: 349 [2022-04-28 15:16:43,343 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 15:16:43,344 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:43,344 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:43,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 484 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:16:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 15:16:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-04-28 15:16:43,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:43,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,352 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,352 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,355 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-04-28 15:16:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2022-04-28 15:16:43,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:43,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:43,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 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 189 states. [2022-04-28 15:16:43,357 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 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 189 states. [2022-04-28 15:16:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:43,360 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-04-28 15:16:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2022-04-28 15:16:43,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:43,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:43,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:43,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2022-04-28 15:16:43,364 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 70 [2022-04-28 15:16:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:43,364 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2022-04-28 15:16:43,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:43,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 278 transitions. [2022-04-28 15:16:43,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2022-04-28 15:16:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 15:16:43,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:43,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:43,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:16:43,557 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 1 times [2022-04-28 15:16:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:43,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129317852] [2022-04-28 15:16:43,595 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:43,595 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 2 times [2022-04-28 15:16:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:43,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157927549] [2022-04-28 15:16:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:43,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:43,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {13367#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13360#true} is VALID [2022-04-28 15:16:43,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {13360#true} assume true; {13360#true} is VALID [2022-04-28 15:16:43,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13360#true} {13360#true} #664#return; {13360#true} is VALID [2022-04-28 15:16:43,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {13360#true} call ULTIMATE.init(); {13367#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:43,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {13367#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13360#true} is VALID [2022-04-28 15:16:43,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {13360#true} assume true; {13360#true} is VALID [2022-04-28 15:16:43,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13360#true} {13360#true} #664#return; {13360#true} is VALID [2022-04-28 15:16:43,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {13360#true} call #t~ret162 := main(); {13360#true} is VALID [2022-04-28 15:16:43,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {13360#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {13360#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L272 TraceCheckUtils]: 7: Hoare triple {13360#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {13360#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {13360#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {13360#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {13360#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {13360#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {13360#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {13360#true} is VALID [2022-04-28 15:16:43,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {13360#true} assume !false; {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {13360#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {13360#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {13360#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {13360#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {13360#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {13360#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {13360#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {13360#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {13360#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {13360#true} assume 8464 == #t~mem50;havoc #t~mem50; {13360#true} is VALID [2022-04-28 15:16:43,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {13360#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; {13360#true} is VALID [2022-04-28 15:16:43,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {13360#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13360#true} is VALID [2022-04-28 15:16:43,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {13360#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:43,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13366#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-28 15:16:43,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {13366#(= |ssl3_accept_#t~mem47| 8496)} assume 8480 == #t~mem47;havoc #t~mem47; {13361#false} is VALID [2022-04-28 15:16:43,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {13361#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {13361#false} is VALID [2022-04-28 15:16:43,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {13361#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {13361#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {13361#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#false} ~skip~0 := 0; {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {13361#false} assume !false; {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {13361#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {13361#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {13361#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {13361#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {13361#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {13361#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {13361#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {13361#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {13361#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {13361#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {13361#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {13361#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {13361#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {13361#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {13361#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {13361#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {13361#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {13361#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {13361#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {13361#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {13361#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {13361#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {13361#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {13361#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 69: Hoare triple {13361#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {13361#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {13361#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {13361#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 73: Hoare triple {13361#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 74: Hoare triple {13361#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 75: Hoare triple {13361#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 76: Hoare triple {13361#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {13361#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {13361#false} assume 8672 == #t~mem74;havoc #t~mem74; {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {13361#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {13361#false} is VALID [2022-04-28 15:16:43,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {13361#false} assume 4 == ~blastFlag~0; {13361#false} is VALID [2022-04-28 15:16:43,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {13361#false} assume !false; {13361#false} is VALID [2022-04-28 15:16:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:43,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157927549] [2022-04-28 15:16:43,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157927549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:43,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:43,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:43,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:43,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129317852] [2022-04-28 15:16:43,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129317852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:43,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:43,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543060828] [2022-04-28 15:16:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 15:16:43,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:43,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:43,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:43,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:43,800 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:48,827 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:50,853 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:16:52,881 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:16:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:53,842 INFO L93 Difference]: Finished difference Result 367 states and 553 transitions. [2022-04-28 15:16:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:53,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 15:16:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 15:16:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 15:16:53,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-28 15:16:54,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:54,146 INFO L225 Difference]: With dead ends: 367 [2022-04-28 15:16:54,146 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 15:16:54,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:16:54,147 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 38 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:54,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 482 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 387 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-28 15:16:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 15:16:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2022-04-28 15:16:54,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:54,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call 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:54,155 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call 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:54,155 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call 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:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,159 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-28 15:16:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-28 15:16:54,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:54,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:54,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 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 207 states. [2022-04-28 15:16:54,160 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 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 207 states. [2022-04-28 15:16:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:54,164 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-28 15:16:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-28 15:16:54,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:54,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:54,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:54,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call 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:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 277 transitions. [2022-04-28 15:16:54,168 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 277 transitions. Word has length 82 [2022-04-28 15:16:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:54,169 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 277 transitions. [2022-04-28 15:16:54,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 277 transitions. [2022-04-28 15:16:54,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 277 transitions. [2022-04-28 15:16:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 15:16:54,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:54,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:54,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:16:54,365 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:54,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 992393497, now seen corresponding path program 1 times [2022-04-28 15:16:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:54,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169723959] [2022-04-28 15:16:54,428 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:54,428 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 992393497, now seen corresponding path program 2 times [2022-04-28 15:16:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:54,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66862136] [2022-04-28 15:16:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:54,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {14899#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14892#true} is VALID [2022-04-28 15:16:54,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {14892#true} assume true; {14892#true} is VALID [2022-04-28 15:16:54,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14892#true} {14892#true} #664#return; {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {14892#true} call ULTIMATE.init(); {14899#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:54,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {14899#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {14892#true} assume true; {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14892#true} {14892#true} #664#return; {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {14892#true} call #t~ret162 := main(); {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {14892#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {14892#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14892#true} is VALID [2022-04-28 15:16:54,577 INFO L272 TraceCheckUtils]: 7: Hoare triple {14892#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {14892#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {14892#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {14892#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {14892#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {14892#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {14892#true} assume !false; {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {14892#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {14892#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {14892#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {14892#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {14892#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {14892#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {14892#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {14892#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {14892#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-28 15:16:54,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {14892#true} assume 8464 == #t~mem50;havoc #t~mem50; {14892#true} is VALID [2022-04-28 15:16:54,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {14892#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; {14892#true} is VALID [2022-04-28 15:16:54,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {14892#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14892#true} is VALID [2022-04-28 15:16:54,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {14892#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:16:54,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14898#(not (= |ssl3_accept_#t~mem48| 8481))} is VALID [2022-04-28 15:16:54,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {14898#(not (= |ssl3_accept_#t~mem48| 8481))} assume 8481 == #t~mem48;havoc #t~mem48; {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {14893#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {14893#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {14893#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {14893#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {14893#false} ~skip~0 := 0; {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {14893#false} assume !false; {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {14893#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {14893#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {14893#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {14893#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {14893#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {14893#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {14893#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {14893#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {14893#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {14893#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {14893#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {14893#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {14893#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {14893#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {14893#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {14893#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {14893#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {14893#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 64: Hoare triple {14893#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {14893#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {14893#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {14893#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {14893#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {14893#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {14893#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {14893#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {14893#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {14893#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {14893#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {14893#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {14893#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {14893#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {14893#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-28 15:16:54,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {14893#false} assume 8672 == #t~mem74;havoc #t~mem74; {14893#false} is VALID [2022-04-28 15:16:54,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {14893#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {14893#false} is VALID [2022-04-28 15:16:54,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {14893#false} assume 4 == ~blastFlag~0; {14893#false} is VALID [2022-04-28 15:16:54,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {14893#false} assume !false; {14893#false} is VALID [2022-04-28 15:16:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:54,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66862136] [2022-04-28 15:16:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66862136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:54,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:54,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169723959] [2022-04-28 15:16:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169723959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914138805] [2022-04-28 15:16:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:16:54,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:54,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:54,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:54,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:54,667 INFO L87 Difference]: Start difference. First operand 186 states and 277 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:56,691 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:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,000 INFO L93 Difference]: Finished difference Result 448 states and 680 transitions. [2022-04-28 15:16:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:16:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:16:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:16:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:16:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:16:58,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-28 15:16:58,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:58,395 INFO L225 Difference]: With dead ends: 448 [2022-04-28 15:16:58,396 INFO L226 Difference]: Without dead ends: 288 [2022-04-28 15:16:58,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:16:58,397 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:16:58,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:16:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-28 15:16:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 189. [2022-04-28 15:16:58,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:16:58,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call 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:58,405 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call 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:58,405 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call 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:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,410 INFO L93 Difference]: Finished difference Result 288 states and 431 transitions. [2022-04-28 15:16:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2022-04-28 15:16:58,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:58,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:58,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 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 288 states. [2022-04-28 15:16:58,412 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 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 288 states. [2022-04-28 15:16:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:16:58,417 INFO L93 Difference]: Finished difference Result 288 states and 431 transitions. [2022-04-28 15:16:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2022-04-28 15:16:58,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:16:58,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:16:58,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:16:58,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:16:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call 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:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 281 transitions. [2022-04-28 15:16:58,422 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 281 transitions. Word has length 83 [2022-04-28 15:16:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:16:58,422 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 281 transitions. [2022-04-28 15:16:58,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 281 transitions. [2022-04-28 15:16:58,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 281 transitions. [2022-04-28 15:16:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 15:16:58,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:16:58,626 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:16:58,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:16:58,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:16:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:16:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 1 times [2022-04-28 15:16:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:58,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [530609512] [2022-04-28 15:16:58,660 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:16:58,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:16:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 2 times [2022-04-28 15:16:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:16:58,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907871161] [2022-04-28 15:16:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:16:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:16:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:16:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:16:58,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {16761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16754#true} is VALID [2022-04-28 15:16:58,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {16754#true} assume true; {16754#true} is VALID [2022-04-28 15:16:58,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16754#true} {16754#true} #664#return; {16754#true} is VALID [2022-04-28 15:16:58,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {16754#true} call ULTIMATE.init(); {16761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:16:58,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {16761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16754#true} is VALID [2022-04-28 15:16:58,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {16754#true} assume true; {16754#true} is VALID [2022-04-28 15:16:58,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16754#true} {16754#true} #664#return; {16754#true} is VALID [2022-04-28 15:16:58,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {16754#true} call #t~ret162 := main(); {16754#true} is VALID [2022-04-28 15:16:58,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {16754#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16754#true} is VALID [2022-04-28 15:16:58,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {16754#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L272 TraceCheckUtils]: 7: Hoare triple {16754#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {16754#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {16754#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {16754#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {16754#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {16754#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {16754#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {16754#true} assume !false; {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {16754#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {16754#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {16754#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {16754#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {16754#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {16754#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {16754#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {16754#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {16754#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {16754#true} assume 8464 == #t~mem50;havoc #t~mem50; {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {16754#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; {16754#true} is VALID [2022-04-28 15:16:58,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {16754#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16754#true} is VALID [2022-04-28 15:16:58,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {16754#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16760#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {16760#(= |ssl3_accept_#t~mem49| 8496)} assume 8482 == #t~mem49;havoc #t~mem49; {16755#false} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {16755#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {16755#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {16755#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16755#false} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {16755#false} ~skip~0 := 0; {16755#false} is VALID [2022-04-28 15:16:58,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {16755#false} assume !false; {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {16755#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {16755#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {16755#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {16755#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {16755#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {16755#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {16755#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {16755#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {16755#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {16755#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {16755#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {16755#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {16755#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {16755#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {16755#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {16755#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {16755#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {16755#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {16755#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {16755#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 66: Hoare triple {16755#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,794 INFO L290 TraceCheckUtils]: 67: Hoare triple {16755#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {16755#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {16755#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {16755#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {16755#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {16755#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {16755#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {16755#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {16755#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 76: Hoare triple {16755#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,795 INFO L290 TraceCheckUtils]: 77: Hoare triple {16755#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {16755#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-28 15:16:58,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {16755#false} assume 8672 == #t~mem74;havoc #t~mem74; {16755#false} is VALID [2022-04-28 15:16:58,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {16755#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {16755#false} is VALID [2022-04-28 15:16:58,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {16755#false} assume 4 == ~blastFlag~0; {16755#false} is VALID [2022-04-28 15:16:58,796 INFO L290 TraceCheckUtils]: 82: Hoare triple {16755#false} assume !false; {16755#false} is VALID [2022-04-28 15:16:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:16:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:16:58,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907871161] [2022-04-28 15:16:58,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907871161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:58,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:58,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:58,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:16:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [530609512] [2022-04-28 15:16:58,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [530609512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:16:58,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:16:58,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:16:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050569072] [2022-04-28 15:16:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:16:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:16:58,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:16:58,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:16:58,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:16:58,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:16:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:16:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:16:58,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:16:58,871 INFO L87 Difference]: Start difference. First operand 189 states and 281 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:00,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:01,853 INFO L93 Difference]: Finished difference Result 370 states and 556 transitions. [2022-04-28 15:17:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:01,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:17:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:17:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:17:01,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-28 15:17:02,146 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:17:02,149 INFO L225 Difference]: With dead ends: 370 [2022-04-28 15:17:02,149 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 15:17:02,149 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:02,150 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 34 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:02,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 488 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 15:17:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2022-04-28 15:17:02,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:02,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call 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:02,157 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call 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:02,157 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call 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:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,161 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-28 15:17:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-28 15:17:02,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:02,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:02,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 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 207 states. [2022-04-28 15:17:02,162 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 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 207 states. [2022-04-28 15:17:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:02,166 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-28 15:17:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-28 15:17:02,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:02,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:02,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:02,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call 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:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2022-04-28 15:17:02,170 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 83 [2022-04-28 15:17:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:02,170 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2022-04-28 15:17:02,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 280 transitions. [2022-04-28 15:17:02,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2022-04-28 15:17:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:17:02,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:02,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:02,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:17:02,389 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 1 times [2022-04-28 15:17:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:02,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87159489] [2022-04-28 15:17:02,428 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:02,428 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 2 times [2022-04-28 15:17:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:02,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632151801] [2022-04-28 15:17:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:02,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {18305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18298#true} is VALID [2022-04-28 15:17:02,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {18298#true} assume true; {18298#true} is VALID [2022-04-28 15:17:02,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18298#true} {18298#true} #664#return; {18298#true} is VALID [2022-04-28 15:17:02,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {18298#true} call ULTIMATE.init(); {18305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {18305#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {18298#true} assume true; {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18298#true} {18298#true} #664#return; {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {18298#true} call #t~ret162 := main(); {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {18298#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {18298#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L272 TraceCheckUtils]: 7: Hoare triple {18298#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {18298#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {18298#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {18298#true} is VALID [2022-04-28 15:17:02,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {18298#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {18298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {18298#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {18298#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {18298#true} assume !false; {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {18298#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {18298#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {18298#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {18298#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {18298#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {18298#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {18298#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {18298#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {18298#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {18298#true} assume 8464 == #t~mem50;havoc #t~mem50; {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {18298#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; {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {18298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {18298#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {18298#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {18298#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {18298#true} is VALID [2022-04-28 15:17:02,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {18298#true} ~skip~0 := 0; {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {18298#true} assume !false; {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {18298#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {18298#true} assume 12292 == #t~mem42;havoc #t~mem42; {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {18298#true} call write~int(1, ~s.base, 60 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {18298#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {18298#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {18298#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {18298#true} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {18298#true} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {18298#true} is VALID [2022-04-28 15:17:02,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {18298#true} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {18298#true} is VALID [2022-04-28 15:17:02,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {18298#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-28 15:17:02,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {18298#true} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:17:02,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18304#(= |ssl3_accept_#t~mem47| 8480)} is VALID [2022-04-28 15:17:02,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {18304#(= |ssl3_accept_#t~mem47| 8480)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {18299#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {18299#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {18299#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {18299#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {18299#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {18299#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {18299#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {18299#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {18299#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,582 INFO L290 TraceCheckUtils]: 63: Hoare triple {18299#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {18299#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {18299#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {18299#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {18299#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {18299#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {18299#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {18299#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {18299#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {18299#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {18299#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 74: Hoare triple {18299#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 75: Hoare triple {18299#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {18299#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {18299#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {18299#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {18299#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {18299#false} assume 8672 == #t~mem74;havoc #t~mem74; {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {18299#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {18299#false} assume 4 == ~blastFlag~0; {18299#false} is VALID [2022-04-28 15:17:02,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {18299#false} assume !false; {18299#false} is VALID [2022-04-28 15:17:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 15:17:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:02,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632151801] [2022-04-28 15:17:02,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632151801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:02,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:02,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:02,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:02,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87159489] [2022-04-28 15:17:02,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87159489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:02,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:02,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127379589] [2022-04-28 15:17:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:02,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:17:02,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:02,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:02,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:02,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:02,661 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:04,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:05,681 INFO L93 Difference]: Finished difference Result 381 states and 572 transitions. [2022-04-28 15:17:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:17:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:17:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-28 15:17:05,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-28 15:17:05,989 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:17:05,992 INFO L225 Difference]: With dead ends: 381 [2022-04-28 15:17:05,992 INFO L226 Difference]: Without dead ends: 218 [2022-04-28 15:17:05,992 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:05,993 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 21 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:05,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 551 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-28 15:17:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2022-04-28 15:17:06,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:06,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call 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:06,001 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call 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:06,002 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call 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:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:06,008 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2022-04-28 15:17:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2022-04-28 15:17:06,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:06,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:06,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 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 218 states. [2022-04-28 15:17:06,010 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 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 218 states. [2022-04-28 15:17:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:06,013 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2022-04-28 15:17:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2022-04-28 15:17:06,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:06,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:06,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:06,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call 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:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2022-04-28 15:17:06,018 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 84 [2022-04-28 15:17:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2022-04-28 15:17:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 305 transitions. [2022-04-28 15:17:06,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2022-04-28 15:17:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:17:06,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:06,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:06,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:17:06,240 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 1 times [2022-04-28 15:17:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:06,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1923545790] [2022-04-28 15:17:06,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:06,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 2 times [2022-04-28 15:17:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:06,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508884364] [2022-04-28 15:17:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:06,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {19926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19918#true} is VALID [2022-04-28 15:17:06,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {19918#true} assume true; {19918#true} is VALID [2022-04-28 15:17:06,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19918#true} {19918#true} #664#return; {19918#true} is VALID [2022-04-28 15:17:06,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {19918#true} call ULTIMATE.init(); {19926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:06,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {19926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19918#true} is VALID [2022-04-28 15:17:06,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {19918#true} assume true; {19918#true} is VALID [2022-04-28 15:17:06,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19918#true} {19918#true} #664#return; {19918#true} is VALID [2022-04-28 15:17:06,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {19918#true} call #t~ret162 := main(); {19918#true} is VALID [2022-04-28 15:17:06,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {19918#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {19918#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L272 TraceCheckUtils]: 7: Hoare triple {19918#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {19918#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {19918#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {19918#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {19918#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {19918#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {19918#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {19918#true} assume !false; {19918#true} is VALID [2022-04-28 15:17:06,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {19918#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {19918#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {19918#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {19918#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {19918#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {19918#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {19918#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {19918#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {19918#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {19918#true} assume 8464 == #t~mem50;havoc #t~mem50; {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {19918#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; {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {19918#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {19918#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {19918#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {19918#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {19918#true} ~skip~0 := 0; {19918#true} is VALID [2022-04-28 15:17:06,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {19918#true} assume !false; {19918#true} is VALID [2022-04-28 15:17:06,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {19918#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {19923#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {19923#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 12292 == #t~mem42;havoc #t~mem42; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 60 + ~s.offset, 4); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 56 + ~s.offset, 4); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:06,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {19925#(= 12292 |ssl3_accept_#t~mem81|)} is VALID [2022-04-28 15:17:06,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {19925#(= 12292 |ssl3_accept_#t~mem81|)} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {19919#false} is VALID [2022-04-28 15:17:06,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {19919#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {19919#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {19919#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 46: Hoare triple {19919#false} ~skip~0 := 0; {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {19919#false} assume !false; {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {19919#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {19919#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {19919#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {19919#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {19919#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {19919#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {19919#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 55: Hoare triple {19919#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {19919#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {19919#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {19919#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {19919#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {19919#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {19919#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {19919#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 63: Hoare triple {19919#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {19919#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {19919#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {19919#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {19919#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 68: Hoare triple {19919#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 69: Hoare triple {19919#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 70: Hoare triple {19919#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 71: Hoare triple {19919#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,429 INFO L290 TraceCheckUtils]: 72: Hoare triple {19919#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 73: Hoare triple {19919#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {19919#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 75: Hoare triple {19919#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {19919#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {19919#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {19919#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 79: Hoare triple {19919#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 80: Hoare triple {19919#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-28 15:17:06,430 INFO L290 TraceCheckUtils]: 81: Hoare triple {19919#false} assume 8672 == #t~mem74;havoc #t~mem74; {19919#false} is VALID [2022-04-28 15:17:06,431 INFO L290 TraceCheckUtils]: 82: Hoare triple {19919#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {19919#false} is VALID [2022-04-28 15:17:06,431 INFO L290 TraceCheckUtils]: 83: Hoare triple {19919#false} assume 4 == ~blastFlag~0; {19919#false} is VALID [2022-04-28 15:17:06,431 INFO L290 TraceCheckUtils]: 84: Hoare triple {19919#false} assume !false; {19919#false} is VALID [2022-04-28 15:17:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 15:17:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:06,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508884364] [2022-04-28 15:17:06,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508884364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:06,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:06,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:17:06,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:06,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1923545790] [2022-04-28 15:17:06,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1923545790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:06,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:06,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:17:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849867586] [2022-04-28 15:17:06,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:17:06,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:06,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:06,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:06,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:17:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:17:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:06,500 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:08,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:09,600 INFO L93 Difference]: Finished difference Result 393 states and 592 transitions. [2022-04-28 15:17:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:17:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:17:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-28 15:17:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-28 15:17:09,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 409 transitions. [2022-04-28 15:17:09,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:09,870 INFO L225 Difference]: With dead ends: 393 [2022-04-28 15:17:09,870 INFO L226 Difference]: Without dead ends: 214 [2022-04-28 15:17:09,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:17:09,871 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:09,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 605 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-28 15:17:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-04-28 15:17:09,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:09,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,880 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,880 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:09,884 INFO L93 Difference]: Finished difference Result 214 states and 316 transitions. [2022-04-28 15:17:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2022-04-28 15:17:09,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:09,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:09,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-28 15:17:09,885 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 214 states. [2022-04-28 15:17:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:09,887 INFO L93 Difference]: Finished difference Result 214 states and 316 transitions. [2022-04-28 15:17:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2022-04-28 15:17:09,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:09,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:09,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:09,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 316 transitions. [2022-04-28 15:17:09,892 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 316 transitions. Word has length 85 [2022-04-28 15:17:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:09,893 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 316 transitions. [2022-04-28 15:17:09,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:09,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 316 transitions. [2022-04-28 15:17:10,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2022-04-28 15:17:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:17:10,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:10,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:10,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:17:10,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1028581177, now seen corresponding path program 1 times [2022-04-28 15:17:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:10,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782042106] [2022-04-28 15:17:10,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:10,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1028581177, now seen corresponding path program 2 times [2022-04-28 15:17:10,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:10,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442077037] [2022-04-28 15:17:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:10,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {21580#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21573#true} is VALID [2022-04-28 15:17:10,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-28 15:17:10,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21573#true} {21573#true} #664#return; {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21580#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:10,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {21580#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #664#return; {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret162 := main(); {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21573#true} is VALID [2022-04-28 15:17:10,297 INFO L272 TraceCheckUtils]: 7: Hoare triple {21573#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {21573#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {21573#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {21573#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {21573#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {21573#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {21573#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#true} assume !false; {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {21573#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {21573#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {21573#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {21573#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {21573#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {21573#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {21573#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {21573#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {21573#true} assume 8464 == #t~mem50;havoc #t~mem50; {21573#true} is VALID [2022-04-28 15:17:10,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {21573#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; {21573#true} is VALID [2022-04-28 15:17:10,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {21573#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21573#true} is VALID [2022-04-28 15:17:10,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {21573#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:10,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:10,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:10,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} ~skip~0 := 0; {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:10,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:10,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:17:10,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {21579#(not (= |ssl3_accept_#t~mem43| 16384))} is VALID [2022-04-28 15:17:10,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {21579#(not (= |ssl3_accept_#t~mem43| 16384))} assume 16384 == #t~mem43;havoc #t~mem43; {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {21574#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {21574#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {21574#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {21574#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {21574#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {21574#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {21574#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {21574#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {21574#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {21574#false} is VALID [2022-04-28 15:17:10,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {21574#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {21574#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {21574#false} ~skip~0 := 0; {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {21574#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {21574#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {21574#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {21574#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {21574#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {21574#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {21574#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {21574#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {21574#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {21574#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {21574#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {21574#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {21574#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {21574#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {21574#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {21574#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {21574#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {21574#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {21574#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {21574#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {21574#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {21574#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {21574#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {21574#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {21574#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {21574#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {21574#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {21574#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {21574#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {21574#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {21574#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L290 TraceCheckUtils]: 79: Hoare triple {21574#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L290 TraceCheckUtils]: 80: Hoare triple {21574#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L290 TraceCheckUtils]: 81: Hoare triple {21574#false} assume 8672 == #t~mem74;havoc #t~mem74; {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L290 TraceCheckUtils]: 82: Hoare triple {21574#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {21574#false} assume 4 == ~blastFlag~0; {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-28 15:17:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:10,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442077037] [2022-04-28 15:17:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442077037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:10,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:10,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:10,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:10,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782042106] [2022-04-28 15:17:10,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782042106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:10,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:10,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355473144] [2022-04-28 15:17:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:10,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:17:10,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:10,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:10,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:10,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:10,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:10,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:10,382 INFO L87 Difference]: Start difference. First operand 214 states and 316 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:12,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:17:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,519 INFO L93 Difference]: Finished difference Result 510 states and 763 transitions. [2022-04-28 15:17:13,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:17:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:17:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:17:13,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-28 15:17:13,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:13,920 INFO L225 Difference]: With dead ends: 510 [2022-04-28 15:17:13,921 INFO L226 Difference]: Without dead ends: 322 [2022-04-28 15:17:13,921 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:13,921 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 143 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:13,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:17:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-28 15:17:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2022-04-28 15:17:13,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:13,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call 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,934 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call 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,935 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call 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,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,941 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2022-04-28 15:17:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 474 transitions. [2022-04-28 15:17:13,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:13,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:13,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 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 322 states. [2022-04-28 15:17:13,943 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 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 322 states. [2022-04-28 15:17:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:13,949 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2022-04-28 15:17:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 474 transitions. [2022-04-28 15:17:13,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:13,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:13,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:13,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call 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,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 313 transitions. [2022-04-28 15:17:13,954 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 313 transitions. Word has length 85 [2022-04-28 15:17:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:13,955 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 313 transitions. [2022-04-28 15:17:13,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:13,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 313 transitions. [2022-04-28 15:17:14,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2022-04-28 15:17:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 15:17:14,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:14,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:14,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:17:14,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash -662610092, now seen corresponding path program 1 times [2022-04-28 15:17:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:14,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219792707] [2022-04-28 15:17:14,233 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:14,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash -662610092, now seen corresponding path program 2 times [2022-04-28 15:17:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:14,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598475440] [2022-04-28 15:17:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:14,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {23684#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23677#true} is VALID [2022-04-28 15:17:14,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {23677#true} assume true; {23677#true} is VALID [2022-04-28 15:17:14,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23677#true} {23677#true} #664#return; {23677#true} is VALID [2022-04-28 15:17:14,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {23677#true} call ULTIMATE.init(); {23684#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:14,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {23684#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23677#true} is VALID [2022-04-28 15:17:14,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {23677#true} assume true; {23677#true} is VALID [2022-04-28 15:17:14,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23677#true} {23677#true} #664#return; {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {23677#true} call #t~ret162 := main(); {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {23677#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {23677#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L272 TraceCheckUtils]: 7: Hoare triple {23677#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {23677#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {23677#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {23677#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {23677#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {23677#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23677#true} is VALID [2022-04-28 15:17:14,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {23677#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {23677#true} assume !false; {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {23677#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {23677#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {23677#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {23677#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {23677#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {23677#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {23677#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {23677#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {23677#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-28 15:17:14,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {23677#true} assume 8464 == #t~mem50;havoc #t~mem50; {23677#true} is VALID [2022-04-28 15:17:14,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {23677#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; {23677#true} is VALID [2022-04-28 15:17:14,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {23677#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23677#true} is VALID [2022-04-28 15:17:14,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {23677#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:14,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23683#(not (= 8192 |ssl3_accept_#t~mem44|))} is VALID [2022-04-28 15:17:14,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {23683#(not (= 8192 |ssl3_accept_#t~mem44|))} assume 8192 == #t~mem44;havoc #t~mem44; {23678#false} is VALID [2022-04-28 15:17:14,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {23678#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {23678#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23678#false} is VALID [2022-04-28 15:17:14,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {23678#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {23678#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {23678#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {23678#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {23678#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {23678#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {23678#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {23678#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {23678#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {23678#false} ~skip~0 := 0; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {23678#false} assume !false; {23678#false} is VALID [2022-04-28 15:17:14,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {23678#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {23678#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {23678#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {23678#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {23678#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {23678#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {23678#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {23678#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {23678#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {23678#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {23678#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {23678#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {23678#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {23678#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {23678#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {23678#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {23678#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 66: Hoare triple {23678#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 67: Hoare triple {23678#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 68: Hoare triple {23678#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,372 INFO L290 TraceCheckUtils]: 69: Hoare triple {23678#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 70: Hoare triple {23678#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {23678#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {23678#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {23678#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {23678#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 75: Hoare triple {23678#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {23678#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {23678#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 78: Hoare triple {23678#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {23678#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {23678#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {23678#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {23678#false} assume 8672 == #t~mem74;havoc #t~mem74; {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {23678#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {23678#false} assume 4 == ~blastFlag~0; {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {23678#false} assume !false; {23678#false} is VALID [2022-04-28 15:17:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:14,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598475440] [2022-04-28 15:17:14,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598475440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:14,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:14,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:14,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:14,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219792707] [2022-04-28 15:17:14,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219792707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:14,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:14,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060498539] [2022-04-28 15:17:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:14,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:17:14,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:14,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:14,446 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:17:14,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:14,447 INFO L87 Difference]: Start difference. First operand 214 states and 313 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:16,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,560 INFO L93 Difference]: Finished difference Result 510 states and 757 transitions. [2022-04-28 15:17:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:17:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-28 15:17:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-28 15:17:17,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-28 15:17:17,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:17,955 INFO L225 Difference]: With dead ends: 510 [2022-04-28 15:17:17,955 INFO L226 Difference]: Without dead ends: 322 [2022-04-28 15:17:17,956 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:17,956 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:17,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-28 15:17:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2022-04-28 15:17:17,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:17,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call 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,966 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call 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,966 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call 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,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,972 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2022-04-28 15:17:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 471 transitions. [2022-04-28 15:17:17,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:17,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:17,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 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 322 states. [2022-04-28 15:17:17,974 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 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 322 states. [2022-04-28 15:17:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:17,980 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2022-04-28 15:17:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 471 transitions. [2022-04-28 15:17:17,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:17,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:17,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:17,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call 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,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 310 transitions. [2022-04-28 15:17:17,985 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 310 transitions. Word has length 86 [2022-04-28 15:17:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:17,985 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 310 transitions. [2022-04-28 15:17:17,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:17,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 310 transitions. [2022-04-28 15:17:18,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2022-04-28 15:17:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:17:18,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:18,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:18,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:17:18,224 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash -398659815, now seen corresponding path program 1 times [2022-04-28 15:17:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:18,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140114498] [2022-04-28 15:17:18,272 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:18,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash -398659815, now seen corresponding path program 2 times [2022-04-28 15:17:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311232555] [2022-04-28 15:17:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:18,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {25788#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25781#true} is VALID [2022-04-28 15:17:18,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {25781#true} assume true; {25781#true} is VALID [2022-04-28 15:17:18,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25781#true} {25781#true} #664#return; {25781#true} is VALID [2022-04-28 15:17:18,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {25781#true} call ULTIMATE.init(); {25788#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:18,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {25788#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25781#true} is VALID [2022-04-28 15:17:18,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {25781#true} assume true; {25781#true} is VALID [2022-04-28 15:17:18,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25781#true} {25781#true} #664#return; {25781#true} is VALID [2022-04-28 15:17:18,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {25781#true} call #t~ret162 := main(); {25781#true} is VALID [2022-04-28 15:17:18,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {25781#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25781#true} is VALID [2022-04-28 15:17:18,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {25781#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L272 TraceCheckUtils]: 7: Hoare triple {25781#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {25781#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {25781#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {25781#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {25781#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {25781#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {25781#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {25781#true} assume !false; {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {25781#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {25781#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {25781#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {25781#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {25781#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {25781#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {25781#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {25781#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {25781#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {25781#true} assume 8464 == #t~mem50;havoc #t~mem50; {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {25781#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; {25781#true} is VALID [2022-04-28 15:17:18,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {25781#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25781#true} is VALID [2022-04-28 15:17:18,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {25781#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:18,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {25787#(not (= |ssl3_accept_#t~mem46| 8195))} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {25787#(not (= |ssl3_accept_#t~mem46| 8195))} assume 8195 == #t~mem46;havoc #t~mem46; {25782#false} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {25782#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {25782#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25782#false} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {25782#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {25782#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {25782#false} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {25782#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {25782#false} is VALID [2022-04-28 15:17:18,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {25782#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {25782#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {25782#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {25782#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {25782#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {25782#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {25782#false} ~skip~0 := 0; {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {25782#false} assume !false; {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {25782#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {25782#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {25782#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {25782#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {25782#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {25782#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {25782#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {25782#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {25782#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {25782#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {25782#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {25782#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {25782#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {25782#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 65: Hoare triple {25782#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 66: Hoare triple {25782#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {25782#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 68: Hoare triple {25782#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 69: Hoare triple {25782#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 70: Hoare triple {25782#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {25782#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {25782#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,403 INFO L290 TraceCheckUtils]: 73: Hoare triple {25782#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {25782#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 75: Hoare triple {25782#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {25782#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {25782#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {25782#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 79: Hoare triple {25782#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 80: Hoare triple {25782#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 81: Hoare triple {25782#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 82: Hoare triple {25782#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 83: Hoare triple {25782#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-28 15:17:18,404 INFO L290 TraceCheckUtils]: 84: Hoare triple {25782#false} assume 8672 == #t~mem74;havoc #t~mem74; {25782#false} is VALID [2022-04-28 15:17:18,405 INFO L290 TraceCheckUtils]: 85: Hoare triple {25782#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {25782#false} is VALID [2022-04-28 15:17:18,405 INFO L290 TraceCheckUtils]: 86: Hoare triple {25782#false} assume 4 == ~blastFlag~0; {25782#false} is VALID [2022-04-28 15:17:18,405 INFO L290 TraceCheckUtils]: 87: Hoare triple {25782#false} assume !false; {25782#false} is VALID [2022-04-28 15:17:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:18,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311232555] [2022-04-28 15:17:18,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311232555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:18,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140114498] [2022-04-28 15:17:18,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140114498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623500165] [2022-04-28 15:17:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:17:18,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:18,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:18,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:18,496 INFO L87 Difference]: Start difference. First operand 214 states and 310 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:20,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:21,607 INFO L93 Difference]: Finished difference Result 500 states and 738 transitions. [2022-04-28 15:17:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:17:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:17:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:17:21,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:17:21,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:21,997 INFO L225 Difference]: With dead ends: 500 [2022-04-28 15:17:21,998 INFO L226 Difference]: Without dead ends: 312 [2022-04-28 15:17:21,998 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:21,999 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:21,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 323 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-28 15:17:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 214. [2022-04-28 15:17:22,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:22,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call 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:22,009 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call 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:22,009 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call 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:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:22,014 INFO L93 Difference]: Finished difference Result 312 states and 455 transitions. [2022-04-28 15:17:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 455 transitions. [2022-04-28 15:17:22,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:22,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:22,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 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 312 states. [2022-04-28 15:17:22,016 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 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 312 states. [2022-04-28 15:17:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:22,022 INFO L93 Difference]: Finished difference Result 312 states and 455 transitions. [2022-04-28 15:17:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 455 transitions. [2022-04-28 15:17:22,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:22,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:22,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:22,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call 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:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 307 transitions. [2022-04-28 15:17:22,026 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 307 transitions. Word has length 88 [2022-04-28 15:17:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:22,027 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 307 transitions. [2022-04-28 15:17:22,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:22,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 307 transitions. [2022-04-28 15:17:22,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 307 transitions. [2022-04-28 15:17:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 15:17:22,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:22,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:22,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:17:22,260 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1973605427, now seen corresponding path program 1 times [2022-04-28 15:17:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:22,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1563895644] [2022-04-28 15:17:22,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:22,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1973605427, now seen corresponding path program 2 times [2022-04-28 15:17:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:22,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477363775] [2022-04-28 15:17:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:22,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:22,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {27852#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27845#true} is VALID [2022-04-28 15:17:22,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {27845#true} assume true; {27845#true} is VALID [2022-04-28 15:17:22,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27845#true} {27845#true} #664#return; {27845#true} is VALID [2022-04-28 15:17:22,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {27845#true} call ULTIMATE.init(); {27852#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:22,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {27852#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27845#true} is VALID [2022-04-28 15:17:22,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {27845#true} assume true; {27845#true} is VALID [2022-04-28 15:17:22,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27845#true} {27845#true} #664#return; {27845#true} is VALID [2022-04-28 15:17:22,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {27845#true} call #t~ret162 := main(); {27845#true} is VALID [2022-04-28 15:17:22,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {27845#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {27845#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L272 TraceCheckUtils]: 7: Hoare triple {27845#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {27845#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {27845#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {27845#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {27845#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {27845#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {27845#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {27845#true} assume !false; {27845#true} is VALID [2022-04-28 15:17:22,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {27845#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {27845#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {27845#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {27845#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {27845#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {27845#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {27845#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {27845#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {27845#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {27845#true} assume 8464 == #t~mem50;havoc #t~mem50; {27845#true} is VALID [2022-04-28 15:17:22,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {27845#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; {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {27845#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {27845#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {27845#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {27845#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {27845#true} ~skip~0 := 0; {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {27845#true} assume !false; {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {27845#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {27845#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {27845#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {27845#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {27845#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {27845#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {27845#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {27845#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {27845#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {27845#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {27845#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {27845#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {27845#true} assume 8496 == #t~mem53;havoc #t~mem53; {27845#true} is VALID [2022-04-28 15:17:22,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {27845#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {27845#true} is VALID [2022-04-28 15:17:22,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {27845#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27845#true} is VALID [2022-04-28 15:17:22,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {27845#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {27845#true} is VALID [2022-04-28 15:17:22,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {27845#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,454 INFO L290 TraceCheckUtils]: 50: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,460 INFO L290 TraceCheckUtils]: 64: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,461 INFO L290 TraceCheckUtils]: 67: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,461 INFO L290 TraceCheckUtils]: 68: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,462 INFO L290 TraceCheckUtils]: 69: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,462 INFO L290 TraceCheckUtils]: 70: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,464 INFO L290 TraceCheckUtils]: 74: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,464 INFO L290 TraceCheckUtils]: 75: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,465 INFO L290 TraceCheckUtils]: 76: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,465 INFO L290 TraceCheckUtils]: 77: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,465 INFO L290 TraceCheckUtils]: 78: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,468 INFO L290 TraceCheckUtils]: 84: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,468 INFO L290 TraceCheckUtils]: 85: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:17:22,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {27851#(not (= |ssl3_accept_#t~mem74| 8672))} is VALID [2022-04-28 15:17:22,469 INFO L290 TraceCheckUtils]: 87: Hoare triple {27851#(not (= |ssl3_accept_#t~mem74| 8672))} assume 8672 == #t~mem74;havoc #t~mem74; {27846#false} is VALID [2022-04-28 15:17:22,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {27846#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {27846#false} is VALID [2022-04-28 15:17:22,469 INFO L290 TraceCheckUtils]: 89: Hoare triple {27846#false} assume 4 == ~blastFlag~0; {27846#false} is VALID [2022-04-28 15:17:22,469 INFO L290 TraceCheckUtils]: 90: Hoare triple {27846#false} assume !false; {27846#false} is VALID [2022-04-28 15:17:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:17:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:22,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477363775] [2022-04-28 15:17:22,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477363775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:22,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:22,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:22,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:22,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1563895644] [2022-04-28 15:17:22,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1563895644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:22,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:22,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491032206] [2022-04-28 15:17:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:22,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 15:17:22,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:22,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:22,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:22,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:22,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:22,534 INFO L87 Difference]: Start difference. First operand 214 states and 307 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:24,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:25,655 INFO L93 Difference]: Finished difference Result 517 states and 756 transitions. [2022-04-28 15:17:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 15:17:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:17:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:17:25,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-28 15:17:26,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:26,059 INFO L225 Difference]: With dead ends: 517 [2022-04-28 15:17:26,059 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:17:26,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:26,060 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 107 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:26,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:17:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:17:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 257. [2022-04-28 15:17:26,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:26,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:26,073 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:26,073 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:26,079 INFO L93 Difference]: Finished difference Result 329 states and 478 transitions. [2022-04-28 15:17:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 478 transitions. [2022-04-28 15:17:26,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:26,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:26,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:17:26,081 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:17:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:26,087 INFO L93 Difference]: Finished difference Result 329 states and 478 transitions. [2022-04-28 15:17:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 478 transitions. [2022-04-28 15:17:26,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:26,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:26,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2022-04-28 15:17:26,093 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 91 [2022-04-28 15:17:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:26,093 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2022-04-28 15:17:26,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:26,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 382 transitions. [2022-04-28 15:17:26,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2022-04-28 15:17:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:17:26,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:26,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:26,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:17:26,453 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1059321323, now seen corresponding path program 1 times [2022-04-28 15:17:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716347801] [2022-04-28 15:17:26,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:26,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1059321323, now seen corresponding path program 2 times [2022-04-28 15:17:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:26,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944202558] [2022-04-28 15:17:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:26,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {30070#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30063#true} is VALID [2022-04-28 15:17:26,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-28 15:17:26,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30063#true} {30063#true} #664#return; {30063#true} is VALID [2022-04-28 15:17:26,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {30063#true} call ULTIMATE.init(); {30070#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:26,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {30070#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30063#true} is VALID [2022-04-28 15:17:26,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-28 15:17:26,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30063#true} {30063#true} #664#return; {30063#true} is VALID [2022-04-28 15:17:26,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {30063#true} call #t~ret162 := main(); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {30063#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {30063#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L272 TraceCheckUtils]: 7: Hoare triple {30063#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {30063#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {30063#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {30063#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {30063#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {30063#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {30063#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {30063#true} assume !false; {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {30063#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {30063#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {30063#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {30063#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {30063#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {30063#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {30063#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {30063#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {30063#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {30063#true} assume 8464 == #t~mem50;havoc #t~mem50; {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {30063#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; {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {30063#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {30063#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {30063#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {30063#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {30063#true} ~skip~0 := 0; {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {30063#true} assume !false; {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {30063#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {30063#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {30063#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {30063#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {30063#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {30063#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {30063#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {30063#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {30063#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {30063#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {30063#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {30063#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {30063#true} assume 8496 == #t~mem53;havoc #t~mem53; {30063#true} is VALID [2022-04-28 15:17:26,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {30063#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {30063#true} is VALID [2022-04-28 15:17:26,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {30063#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30063#true} is VALID [2022-04-28 15:17:26,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {30063#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:17:26,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {30063#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,622 INFO L290 TraceCheckUtils]: 55: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,627 INFO L290 TraceCheckUtils]: 66: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,628 INFO L290 TraceCheckUtils]: 68: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,628 INFO L290 TraceCheckUtils]: 69: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,628 INFO L290 TraceCheckUtils]: 70: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,629 INFO L290 TraceCheckUtils]: 71: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,629 INFO L290 TraceCheckUtils]: 72: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,630 INFO L290 TraceCheckUtils]: 73: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,630 INFO L290 TraceCheckUtils]: 74: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,631 INFO L290 TraceCheckUtils]: 75: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,631 INFO L290 TraceCheckUtils]: 76: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,631 INFO L290 TraceCheckUtils]: 77: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,632 INFO L290 TraceCheckUtils]: 79: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,633 INFO L290 TraceCheckUtils]: 80: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,633 INFO L290 TraceCheckUtils]: 81: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,634 INFO L290 TraceCheckUtils]: 82: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,634 INFO L290 TraceCheckUtils]: 83: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,634 INFO L290 TraceCheckUtils]: 84: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:26,636 INFO L290 TraceCheckUtils]: 87: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8672 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30069#(not (= |ssl3_accept_#t~mem75| 8673))} is VALID [2022-04-28 15:17:26,636 INFO L290 TraceCheckUtils]: 88: Hoare triple {30069#(not (= |ssl3_accept_#t~mem75| 8673))} assume 8673 == #t~mem75;havoc #t~mem75; {30064#false} is VALID [2022-04-28 15:17:26,636 INFO L290 TraceCheckUtils]: 89: Hoare triple {30064#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {30064#false} is VALID [2022-04-28 15:17:26,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {30064#false} assume 4 == ~blastFlag~0; {30064#false} is VALID [2022-04-28 15:17:26,636 INFO L290 TraceCheckUtils]: 91: Hoare triple {30064#false} assume !false; {30064#false} is VALID [2022-04-28 15:17:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:17:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:26,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944202558] [2022-04-28 15:17:26,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944202558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:26,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:26,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:26,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716347801] [2022-04-28 15:17:26,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716347801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:26,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:26,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281892498] [2022-04-28 15:17:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:26,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:17:26,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:26,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:26,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:26,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:26,701 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:28,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:29,864 INFO L93 Difference]: Finished difference Result 586 states and 882 transitions. [2022-04-28 15:17:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:17:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:17:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:17:29,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-28 15:17:30,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:30,256 INFO L225 Difference]: With dead ends: 586 [2022-04-28 15:17:30,256 INFO L226 Difference]: Without dead ends: 353 [2022-04-28 15:17:30,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:30,257 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:30,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 339 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:17:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-28 15:17:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 282. [2022-04-28 15:17:30,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:30,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call 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:30,271 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call 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:30,272 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call 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:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:30,287 INFO L93 Difference]: Finished difference Result 353 states and 526 transitions. [2022-04-28 15:17:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 526 transitions. [2022-04-28 15:17:30,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:30,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:30,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 states have internal predecessors, (427), 3 states have call successors, (3), 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 353 states. [2022-04-28 15:17:30,288 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 states have internal predecessors, (427), 3 states have call successors, (3), 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 353 states. [2022-04-28 15:17:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:30,295 INFO L93 Difference]: Finished difference Result 353 states and 526 transitions. [2022-04-28 15:17:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 526 transitions. [2022-04-28 15:17:30,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:30,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:30,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:30,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call 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:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 431 transitions. [2022-04-28 15:17:30,302 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 431 transitions. Word has length 92 [2022-04-28 15:17:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:30,302 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 431 transitions. [2022-04-28 15:17:30,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:30,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 282 states and 431 transitions. [2022-04-28 15:17:30,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 431 transitions. [2022-04-28 15:17:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 15:17:30,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:30,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:17:30,619 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash 502133768, now seen corresponding path program 1 times [2022-04-28 15:17:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:30,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126960963] [2022-04-28 15:17:30,695 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:30,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 502133768, now seen corresponding path program 2 times [2022-04-28 15:17:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715695656] [2022-04-28 15:17:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:30,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {32524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32517#true} is VALID [2022-04-28 15:17:30,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {32517#true} assume true; {32517#true} is VALID [2022-04-28 15:17:30,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32517#true} {32517#true} #664#return; {32517#true} is VALID [2022-04-28 15:17:30,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {32517#true} call ULTIMATE.init(); {32524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:30,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {32524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32517#true} is VALID [2022-04-28 15:17:30,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {32517#true} assume true; {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32517#true} {32517#true} #664#return; {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {32517#true} call #t~ret162 := main(); {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {32517#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {32517#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L272 TraceCheckUtils]: 7: Hoare triple {32517#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {32517#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {32517#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {32517#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {32517#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32517#true} is VALID [2022-04-28 15:17:30,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {32517#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {32517#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {32517#true} assume !false; {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {32517#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {32517#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {32517#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {32517#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {32517#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {32517#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {32517#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {32517#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {32517#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {32517#true} assume 8464 == #t~mem50;havoc #t~mem50; {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {32517#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; {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {32517#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {32517#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {32517#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {32517#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {32517#true} ~skip~0 := 0; {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {32517#true} assume !false; {32517#true} is VALID [2022-04-28 15:17:30,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {32517#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {32517#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {32517#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {32517#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {32517#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {32517#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {32517#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {32517#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {32517#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {32517#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {32517#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {32517#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {32517#true} assume 8496 == #t~mem53;havoc #t~mem53; {32517#true} is VALID [2022-04-28 15:17:30,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {32517#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {32517#true} is VALID [2022-04-28 15:17:30,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {32517#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32517#true} is VALID [2022-04-28 15:17:30,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {32517#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {32517#true} is VALID [2022-04-28 15:17:30,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {32517#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,869 INFO L290 TraceCheckUtils]: 50: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,871 INFO L290 TraceCheckUtils]: 55: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,876 INFO L290 TraceCheckUtils]: 67: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,877 INFO L290 TraceCheckUtils]: 70: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:17:30,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32523#(not (= 8448 |ssl3_accept_#t~mem63|))} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {32523#(not (= 8448 |ssl3_accept_#t~mem63|))} assume 8448 == #t~mem63;havoc #t~mem63; {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {32518#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {32518#false} assume !(~num1~0 > 0); {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {32518#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem132 := read~int(#t~mem131.base, 904 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 72 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {32518#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {32518#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 82: Hoare triple {32518#false} ~skip~0 := 0; {32518#false} is VALID [2022-04-28 15:17:30,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {32518#false} assume !false; {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {32518#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {32518#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 86: Hoare triple {32518#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 87: Hoare triple {32518#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 88: Hoare triple {32518#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {32518#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 90: Hoare triple {32518#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 91: Hoare triple {32518#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 92: Hoare triple {32518#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 93: Hoare triple {32518#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,881 INFO L290 TraceCheckUtils]: 94: Hoare triple {32518#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 95: Hoare triple {32518#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {32518#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {32518#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {32518#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {32518#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {32518#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {32518#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {32518#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {32518#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {32518#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {32518#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 106: Hoare triple {32518#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 107: Hoare triple {32518#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {32518#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {32518#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {32518#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 111: Hoare triple {32518#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 112: Hoare triple {32518#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 113: Hoare triple {32518#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 114: Hoare triple {32518#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,883 INFO L290 TraceCheckUtils]: 115: Hoare triple {32518#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,884 INFO L290 TraceCheckUtils]: 116: Hoare triple {32518#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-28 15:17:30,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {32518#false} assume 8672 == #t~mem74;havoc #t~mem74; {32518#false} is VALID [2022-04-28 15:17:30,884 INFO L290 TraceCheckUtils]: 118: Hoare triple {32518#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {32518#false} is VALID [2022-04-28 15:17:30,884 INFO L290 TraceCheckUtils]: 119: Hoare triple {32518#false} assume 4 == ~blastFlag~0; {32518#false} is VALID [2022-04-28 15:17:30,884 INFO L290 TraceCheckUtils]: 120: Hoare triple {32518#false} assume !false; {32518#false} is VALID [2022-04-28 15:17:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:17:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:30,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715695656] [2022-04-28 15:17:30,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715695656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:30,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:30,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:30,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:30,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126960963] [2022-04-28 15:17:30,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126960963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:30,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:30,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391980046] [2022-04-28 15:17:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:30,887 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 121 [2022-04-28 15:17:30,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:30,887 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:17:30,978 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:17:30,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:30,979 INFO L87 Difference]: Start difference. First operand 282 states and 431 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:17:33,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:34,115 INFO L93 Difference]: Finished difference Result 647 states and 995 transitions. [2022-04-28 15:17:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:34,115 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 121 [2022-04-28 15:17:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:34,116 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:17:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-28 15:17:34,118 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:17:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-28 15:17:34,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-28 15:17:34,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:34,495 INFO L225 Difference]: With dead ends: 647 [2022-04-28 15:17:34,495 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 15:17:34,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:17:34,496 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 115 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:34,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 355 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 15:17:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 314. [2022-04-28 15:17:34,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:34,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:34,512 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:34,512 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:34,520 INFO L93 Difference]: Finished difference Result 391 states and 592 transitions. [2022-04-28 15:17:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2022-04-28 15:17:34,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:34,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:34,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 391 states. [2022-04-28 15:17:34,521 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 391 states. [2022-04-28 15:17:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:34,527 INFO L93 Difference]: Finished difference Result 391 states and 592 transitions. [2022-04-28 15:17:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2022-04-28 15:17:34,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:34,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:34,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:34,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 483 transitions. [2022-04-28 15:17:34,535 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 483 transitions. Word has length 121 [2022-04-28 15:17:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:34,535 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 483 transitions. [2022-04-28 15:17:34,536 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:17:34,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 314 states and 483 transitions. [2022-04-28 15:17:34,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 483 transitions. [2022-04-28 15:17:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 15:17:34,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:34,972 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:34,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:17:34,972 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:34,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1513581320, now seen corresponding path program 1 times [2022-04-28 15:17:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:34,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826834104] [2022-04-28 15:17:35,069 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:35,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1513581320, now seen corresponding path program 2 times [2022-04-28 15:17:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:35,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663992989] [2022-04-28 15:17:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:35,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {35240#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35233#true} is VALID [2022-04-28 15:17:35,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {35233#true} assume true; {35233#true} is VALID [2022-04-28 15:17:35,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35233#true} {35233#true} #664#return; {35233#true} is VALID [2022-04-28 15:17:35,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {35233#true} call ULTIMATE.init(); {35240#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:35,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {35240#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {35233#true} assume true; {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35233#true} {35233#true} #664#return; {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {35233#true} call #t~ret162 := main(); {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {35233#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {35233#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L272 TraceCheckUtils]: 7: Hoare triple {35233#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {35233#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {35233#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {35233#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {35233#true} is VALID [2022-04-28 15:17:35,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {35233#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {35233#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {35233#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {35233#true} assume !false; {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {35233#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {35233#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {35233#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {35233#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {35233#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {35233#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {35233#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {35233#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {35233#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-28 15:17:35,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {35233#true} assume 8464 == #t~mem50;havoc #t~mem50; {35233#true} is VALID [2022-04-28 15:17:35,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {35233#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; {35233#true} is VALID [2022-04-28 15:17:35,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {35233#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35233#true} is VALID [2022-04-28 15:17:35,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {35233#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:35,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:35,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:35,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:35,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:35,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35239#(= |ssl3_accept_#t~mem42| 8496)} is VALID [2022-04-28 15:17:35,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {35239#(= |ssl3_accept_#t~mem42| 8496)} assume 12292 == #t~mem42;havoc #t~mem42; {35234#false} is VALID [2022-04-28 15:17:35,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {35234#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {35234#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {35234#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {35234#false} is VALID [2022-04-28 15:17:35,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {35234#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {35234#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {35234#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {35234#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {35234#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {35234#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {35234#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {35234#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {35234#false} ~skip~0 := 0; {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {35234#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {35234#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {35234#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {35234#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {35234#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {35234#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {35234#false} assume 8480 == #t~mem47;havoc #t~mem47; {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {35234#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {35234#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {35234#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {35234#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {35234#false} ~skip~0 := 0; {35234#false} is VALID [2022-04-28 15:17:35,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {35234#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {35234#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {35234#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {35234#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {35234#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {35234#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {35234#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {35234#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {35234#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {35234#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {35234#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {35234#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {35234#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {35234#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {35234#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {35234#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {35234#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {35234#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {35234#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {35234#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {35234#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {35234#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {35234#false} assume 8448 == #t~mem63;havoc #t~mem63; {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {35234#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {35234#false} assume !(~num1~0 > 0); {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {35234#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem132 := read~int(#t~mem131.base, 904 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 72 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {35234#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {35234#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {35234#false} ~skip~0 := 0; {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {35234#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {35234#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {35234#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 93: Hoare triple {35234#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 94: Hoare triple {35234#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {35234#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {35234#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 97: Hoare triple {35234#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 98: Hoare triple {35234#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 99: Hoare triple {35234#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 100: Hoare triple {35234#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {35234#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {35234#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,214 INFO L290 TraceCheckUtils]: 103: Hoare triple {35234#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 104: Hoare triple {35234#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 105: Hoare triple {35234#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 106: Hoare triple {35234#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 107: Hoare triple {35234#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 108: Hoare triple {35234#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 109: Hoare triple {35234#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 110: Hoare triple {35234#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 111: Hoare triple {35234#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 112: Hoare triple {35234#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 113: Hoare triple {35234#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,215 INFO L290 TraceCheckUtils]: 114: Hoare triple {35234#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 115: Hoare triple {35234#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 116: Hoare triple {35234#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 117: Hoare triple {35234#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 118: Hoare triple {35234#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 119: Hoare triple {35234#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 120: Hoare triple {35234#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 121: Hoare triple {35234#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 122: Hoare triple {35234#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 123: Hoare triple {35234#false} assume 8672 == #t~mem74;havoc #t~mem74; {35234#false} is VALID [2022-04-28 15:17:35,216 INFO L290 TraceCheckUtils]: 124: Hoare triple {35234#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {35234#false} is VALID [2022-04-28 15:17:35,217 INFO L290 TraceCheckUtils]: 125: Hoare triple {35234#false} assume 4 == ~blastFlag~0; {35234#false} is VALID [2022-04-28 15:17:35,217 INFO L290 TraceCheckUtils]: 126: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-28 15:17:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 15:17:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:35,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663992989] [2022-04-28 15:17:35,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663992989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:35,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:35,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:35,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:35,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826834104] [2022-04-28 15:17:35,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826834104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:35,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:35,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360280224] [2022-04-28 15:17:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:35,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 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 127 [2022-04-28 15:17:35,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:35,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:35,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:35,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:35,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:35,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:35,282 INFO L87 Difference]: Start difference. First operand 314 states and 483 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:37,305 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:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:38,232 INFO L93 Difference]: Finished difference Result 609 states and 946 transitions. [2022-04-28 15:17:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 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 127 [2022-04-28 15:17:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call 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:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-28 15:17:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call 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:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-28 15:17:38,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-28 15:17:38,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:38,516 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:17:38,516 INFO L226 Difference]: Without dead ends: 321 [2022-04-28 15:17:38,517 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:38,517 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 30 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:38,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 504 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-28 15:17:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2022-04-28 15:17:38,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:38,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call 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:38,531 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call 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:38,531 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call 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:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:38,537 INFO L93 Difference]: Finished difference Result 321 states and 492 transitions. [2022-04-28 15:17:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 492 transitions. [2022-04-28 15:17:38,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:38,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:38,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 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 321 states. [2022-04-28 15:17:38,539 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 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 321 states. [2022-04-28 15:17:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:38,545 INFO L93 Difference]: Finished difference Result 321 states and 492 transitions. [2022-04-28 15:17:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 492 transitions. [2022-04-28 15:17:38,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:38,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:38,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:38,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call 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:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 482 transitions. [2022-04-28 15:17:38,552 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 482 transitions. Word has length 127 [2022-04-28 15:17:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:38,553 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 482 transitions. [2022-04-28 15:17:38,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call 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:38,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 314 states and 482 transitions. [2022-04-28 15:17:38,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2022-04-28 15:17:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:17:38,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:38,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:17:38,923 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash 773095969, now seen corresponding path program 1 times [2022-04-28 15:17:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:38,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243457418] [2022-04-28 15:17:39,013 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:39,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 773095969, now seen corresponding path program 2 times [2022-04-28 15:17:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:39,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220875342] [2022-04-28 15:17:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:39,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {37739#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37733#true} is VALID [2022-04-28 15:17:39,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {37733#true} assume true; {37733#true} is VALID [2022-04-28 15:17:39,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37733#true} {37733#true} #664#return; {37733#true} is VALID [2022-04-28 15:17:39,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {37733#true} call ULTIMATE.init(); {37739#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:39,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {37739#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {37733#true} assume true; {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37733#true} {37733#true} #664#return; {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {37733#true} call #t~ret162 := main(); {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {37733#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {37733#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L272 TraceCheckUtils]: 7: Hoare triple {37733#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {37733#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {37733#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {37733#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {37733#true} is VALID [2022-04-28 15:17:39,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {37733#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {37733#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {37733#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {37733#true} assume !false; {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {37733#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {37733#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {37733#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {37733#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {37733#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {37733#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {37733#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {37733#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {37733#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {37733#true} assume 8464 == #t~mem50;havoc #t~mem50; {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {37733#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; {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {37733#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {37733#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {37733#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {37733#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {37733#true} ~skip~0 := 0; {37733#true} is VALID [2022-04-28 15:17:39,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {37733#true} assume !false; {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {37733#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {37733#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {37733#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {37733#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {37733#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {37733#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {37733#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {37733#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {37733#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {37733#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {37733#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {37733#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {37733#true} assume 8496 == #t~mem53;havoc #t~mem53; {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {37733#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {37733#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {37733#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {37733#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {37733#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {37733#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {37733#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {37733#true} is VALID [2022-04-28 15:17:39,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {37733#true} ~skip~0 := 0; {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {37733#true} assume !false; {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {37733#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {37733#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {37733#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {37733#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {37733#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {37733#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {37733#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {37733#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {37733#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {37733#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {37733#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {37733#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {37733#true} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {37733#true} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {37733#true} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {37733#true} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {37733#true} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 71: Hoare triple {37733#true} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {37733#true} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {37733#true} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {37733#true} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 75: Hoare triple {37733#true} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {37733#true} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {37733#true} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {37733#true} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 79: Hoare triple {37733#true} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 80: Hoare triple {37733#true} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 81: Hoare triple {37733#true} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,150 INFO L290 TraceCheckUtils]: 82: Hoare triple {37733#true} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,151 INFO L290 TraceCheckUtils]: 83: Hoare triple {37733#true} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,151 INFO L290 TraceCheckUtils]: 84: Hoare triple {37733#true} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-28 15:17:39,151 INFO L290 TraceCheckUtils]: 85: Hoare triple {37733#true} assume 8656 == #t~mem72;havoc #t~mem72; {37733#true} is VALID [2022-04-28 15:17:39,151 INFO L290 TraceCheckUtils]: 86: Hoare triple {37733#true} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {37733#true} is VALID [2022-04-28 15:17:39,151 INFO L290 TraceCheckUtils]: 87: Hoare triple {37733#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {37733#true} is VALID [2022-04-28 15:17:39,152 INFO L290 TraceCheckUtils]: 88: Hoare triple {37733#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,152 INFO L290 TraceCheckUtils]: 89: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,152 INFO L290 TraceCheckUtils]: 90: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,153 INFO L290 TraceCheckUtils]: 91: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,153 INFO L290 TraceCheckUtils]: 92: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,153 INFO L290 TraceCheckUtils]: 93: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,153 INFO L290 TraceCheckUtils]: 94: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !false; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,154 INFO L290 TraceCheckUtils]: 95: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,154 INFO L290 TraceCheckUtils]: 96: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,154 INFO L290 TraceCheckUtils]: 97: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,155 INFO L290 TraceCheckUtils]: 98: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,155 INFO L290 TraceCheckUtils]: 99: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,155 INFO L290 TraceCheckUtils]: 100: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,156 INFO L290 TraceCheckUtils]: 101: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,156 INFO L290 TraceCheckUtils]: 102: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,156 INFO L290 TraceCheckUtils]: 103: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,157 INFO L290 TraceCheckUtils]: 104: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,157 INFO L290 TraceCheckUtils]: 105: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,157 INFO L290 TraceCheckUtils]: 106: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,158 INFO L290 TraceCheckUtils]: 107: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,158 INFO L290 TraceCheckUtils]: 108: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,158 INFO L290 TraceCheckUtils]: 109: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,159 INFO L290 TraceCheckUtils]: 110: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,159 INFO L290 TraceCheckUtils]: 111: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,159 INFO L290 TraceCheckUtils]: 112: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,159 INFO L290 TraceCheckUtils]: 113: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,160 INFO L290 TraceCheckUtils]: 114: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,160 INFO L290 TraceCheckUtils]: 115: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,160 INFO L290 TraceCheckUtils]: 116: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,161 INFO L290 TraceCheckUtils]: 117: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,161 INFO L290 TraceCheckUtils]: 118: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,161 INFO L290 TraceCheckUtils]: 119: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,162 INFO L290 TraceCheckUtils]: 120: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,162 INFO L290 TraceCheckUtils]: 121: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,162 INFO L290 TraceCheckUtils]: 122: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,163 INFO L290 TraceCheckUtils]: 123: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,163 INFO L290 TraceCheckUtils]: 124: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,163 INFO L290 TraceCheckUtils]: 125: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,164 INFO L290 TraceCheckUtils]: 126: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,164 INFO L290 TraceCheckUtils]: 127: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,164 INFO L290 TraceCheckUtils]: 128: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem74;havoc #t~mem74; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,165 INFO L290 TraceCheckUtils]: 129: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:39,165 INFO L290 TraceCheckUtils]: 130: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0; {37734#false} is VALID [2022-04-28 15:17:39,165 INFO L290 TraceCheckUtils]: 131: Hoare triple {37734#false} assume !false; {37734#false} is VALID [2022-04-28 15:17:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:17:39,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220875342] [2022-04-28 15:17:39,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220875342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:39,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:39,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:39,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243457418] [2022-04-28 15:17:39,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243457418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:39,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:39,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170222228] [2022-04-28 15:17:39,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 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 132 [2022-04-28 15:17:39,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:39,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call 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:39,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:39,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:17:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:17:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:17:39,247 INFO L87 Difference]: Start difference. First operand 314 states and 482 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call 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:41,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:42,431 INFO L93 Difference]: Finished difference Result 890 states and 1386 transitions. [2022-04-28 15:17:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:17:42,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 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 132 [2022-04-28 15:17:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call 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:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-28 15:17:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call 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:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-28 15:17:42,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 586 transitions. [2022-04-28 15:17:42,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:42,836 INFO L225 Difference]: With dead ends: 890 [2022-04-28 15:17:42,836 INFO L226 Difference]: Without dead ends: 602 [2022-04-28 15:17:42,836 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:17:42,837 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:42,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 565 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-04-28 15:17:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2022-04-28 15:17:43,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:43,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:43,015 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:43,015 INFO L87 Difference]: Start difference. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:43,032 INFO L93 Difference]: Finished difference Result 602 states and 929 transitions. [2022-04-28 15:17:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 929 transitions. [2022-04-28 15:17:43,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:43,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:43,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 602 states. [2022-04-28 15:17:43,035 INFO L87 Difference]: Start difference. First operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 602 states. [2022-04-28 15:17:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:43,052 INFO L93 Difference]: Finished difference Result 602 states and 929 transitions. [2022-04-28 15:17:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 929 transitions. [2022-04-28 15:17:43,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:43,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:43,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:43,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 928 transitions. [2022-04-28 15:17:43,077 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 928 transitions. Word has length 132 [2022-04-28 15:17:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:43,077 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 928 transitions. [2022-04-28 15:17:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call 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:43,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 928 transitions. [2022-04-28 15:17:43,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 928 edges. 928 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 928 transitions. [2022-04-28 15:17:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:17:43,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:43,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:43,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:17:43,968 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1276291873, now seen corresponding path program 1 times [2022-04-28 15:17:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:43,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019259018] [2022-04-28 15:17:44,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:44,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:44,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1276291873, now seen corresponding path program 2 times [2022-04-28 15:17:44,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:44,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163880402] [2022-04-28 15:17:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:44,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {41932#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41926#true} is VALID [2022-04-28 15:17:44,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {41926#true} assume true; {41926#true} is VALID [2022-04-28 15:17:44,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41926#true} {41926#true} #664#return; {41926#true} is VALID [2022-04-28 15:17:44,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {41926#true} call ULTIMATE.init(); {41932#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:44,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {41932#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41926#true} is VALID [2022-04-28 15:17:44,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {41926#true} assume true; {41926#true} is VALID [2022-04-28 15:17:44,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41926#true} {41926#true} #664#return; {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {41926#true} call #t~ret162 := main(); {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {41926#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {41926#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L272 TraceCheckUtils]: 7: Hoare triple {41926#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {41926#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {41926#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {41926#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {41926#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41926#true} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {41926#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {41926#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {41926#true} assume !false; {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {41926#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {41926#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {41926#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {41926#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {41926#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {41926#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {41926#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {41926#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {41926#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {41926#true} assume 8464 == #t~mem50;havoc #t~mem50; {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {41926#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; {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {41926#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {41926#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {41926#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {41926#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {41926#true} ~skip~0 := 0; {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {41926#true} assume !false; {41926#true} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {41926#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {41926#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {41926#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {41926#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {41926#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {41926#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {41926#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {41926#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {41926#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {41926#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {41926#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {41926#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {41926#true} assume 8496 == #t~mem53;havoc #t~mem53; {41926#true} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {41926#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {41926#true} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {41926#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,230 INFO L290 TraceCheckUtils]: 63: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,232 INFO L290 TraceCheckUtils]: 68: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,235 INFO L290 TraceCheckUtils]: 76: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,235 INFO L290 TraceCheckUtils]: 77: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,235 INFO L290 TraceCheckUtils]: 78: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,236 INFO L290 TraceCheckUtils]: 81: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,236 INFO L290 TraceCheckUtils]: 82: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,237 INFO L290 TraceCheckUtils]: 84: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,237 INFO L290 TraceCheckUtils]: 85: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem72;havoc #t~mem72; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,238 INFO L290 TraceCheckUtils]: 87: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:17:44,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(2 == ~blastFlag~0); {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {41927#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 90: Hoare triple {41927#false} assume !(0 == ~tmp___10~0); {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {41927#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 92: Hoare triple {41927#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 93: Hoare triple {41927#false} ~skip~0 := 0; {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 94: Hoare triple {41927#false} assume !false; {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 95: Hoare triple {41927#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {41927#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {41927#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,239 INFO L290 TraceCheckUtils]: 98: Hoare triple {41927#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 99: Hoare triple {41927#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 100: Hoare triple {41927#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 101: Hoare triple {41927#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 102: Hoare triple {41927#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 103: Hoare triple {41927#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 104: Hoare triple {41927#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 105: Hoare triple {41927#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 106: Hoare triple {41927#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 107: Hoare triple {41927#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,240 INFO L290 TraceCheckUtils]: 108: Hoare triple {41927#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 109: Hoare triple {41927#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 110: Hoare triple {41927#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 111: Hoare triple {41927#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 112: Hoare triple {41927#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 113: Hoare triple {41927#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 114: Hoare triple {41927#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 115: Hoare triple {41927#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 116: Hoare triple {41927#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 117: Hoare triple {41927#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,241 INFO L290 TraceCheckUtils]: 118: Hoare triple {41927#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 119: Hoare triple {41927#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 120: Hoare triple {41927#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 121: Hoare triple {41927#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 122: Hoare triple {41927#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 123: Hoare triple {41927#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 124: Hoare triple {41927#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 125: Hoare triple {41927#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 126: Hoare triple {41927#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 127: Hoare triple {41927#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 128: Hoare triple {41927#false} assume 8672 == #t~mem74;havoc #t~mem74; {41927#false} is VALID [2022-04-28 15:17:44,242 INFO L290 TraceCheckUtils]: 129: Hoare triple {41927#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {41927#false} is VALID [2022-04-28 15:17:44,243 INFO L290 TraceCheckUtils]: 130: Hoare triple {41927#false} assume 4 == ~blastFlag~0; {41927#false} is VALID [2022-04-28 15:17:44,243 INFO L290 TraceCheckUtils]: 131: Hoare triple {41927#false} assume !false; {41927#false} is VALID [2022-04-28 15:17:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:17:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163880402] [2022-04-28 15:17:44,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163880402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:44,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:44,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:44,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:44,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019259018] [2022-04-28 15:17:44,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019259018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:44,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:44,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802333842] [2022-04-28 15:17:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:44,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-04-28 15:17:44,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:44,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call 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,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:44,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:17:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:17:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:17:44,327 INFO L87 Difference]: Start difference. First operand 600 states and 928 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call 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,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,284 INFO L93 Difference]: Finished difference Result 1415 states and 2201 transitions. [2022-04-28 15:17:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:17:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-04-28 15:17:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call 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,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-28 15:17:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call 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,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-28 15:17:47,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-04-28 15:17:47,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:47,696 INFO L225 Difference]: With dead ends: 1415 [2022-04-28 15:17:47,697 INFO L226 Difference]: Without dead ends: 841 [2022-04-28 15:17:47,697 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:17:47,698 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 138 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:47,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 438 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:17:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-28 15:17:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-04-28 15:17:47,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:47,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call 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,860 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call 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,861 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call 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,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,892 INFO L93 Difference]: Finished difference Result 841 states and 1297 transitions. [2022-04-28 15:17:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2022-04-28 15:17:47,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:47,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:47,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 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 841 states. [2022-04-28 15:17:47,896 INFO L87 Difference]: Start difference. First operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 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 841 states. [2022-04-28 15:17:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,929 INFO L93 Difference]: Finished difference Result 841 states and 1297 transitions. [2022-04-28 15:17:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2022-04-28 15:17:47,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:47,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:47,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:47,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call 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,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1297 transitions. [2022-04-28 15:17:47,979 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1297 transitions. Word has length 132 [2022-04-28 15:17:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:47,979 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1297 transitions. [2022-04-28 15:17:47,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call 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,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1297 transitions. [2022-04-28 15:17:49,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1297 edges. 1297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2022-04-28 15:17:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:17:49,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:49,123 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:49,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:17:49,123 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100637, now seen corresponding path program 1 times [2022-04-28 15:17:49,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:49,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980665954] [2022-04-28 15:17:49,212 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:49,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100637, now seen corresponding path program 2 times [2022-04-28 15:17:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:49,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140470790] [2022-04-28 15:17:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:49,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:49,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {48135#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48129#true} is VALID [2022-04-28 15:17:49,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {48129#true} assume true; {48129#true} is VALID [2022-04-28 15:17:49,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48129#true} {48129#true} #664#return; {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {48129#true} call ULTIMATE.init(); {48135#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:49,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {48135#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {48129#true} assume true; {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48129#true} {48129#true} #664#return; {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {48129#true} call #t~ret162 := main(); {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {48129#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {48129#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48129#true} is VALID [2022-04-28 15:17:49,337 INFO L272 TraceCheckUtils]: 7: Hoare triple {48129#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {48129#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {48129#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {48129#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {48129#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {48129#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {48129#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {48129#true} assume !false; {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {48129#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {48129#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {48129#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {48129#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {48129#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {48129#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {48129#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {48129#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {48129#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {48129#true} assume 8464 == #t~mem50;havoc #t~mem50; {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {48129#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; {48129#true} is VALID [2022-04-28 15:17:49,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {48129#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !false; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem53;havoc #t~mem53; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {48130#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {48130#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {48130#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {48130#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 51: Hoare triple {48130#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {48130#false} ~skip~0 := 0; {48130#false} is VALID [2022-04-28 15:17:49,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {48130#false} assume !false; {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {48130#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {48130#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {48130#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {48130#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 58: Hoare triple {48130#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {48130#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 60: Hoare triple {48130#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {48130#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {48130#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,347 INFO L290 TraceCheckUtils]: 63: Hoare triple {48130#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {48130#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 65: Hoare triple {48130#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 66: Hoare triple {48130#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 67: Hoare triple {48130#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 68: Hoare triple {48130#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 69: Hoare triple {48130#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {48130#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 71: Hoare triple {48130#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {48130#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {48130#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,348 INFO L290 TraceCheckUtils]: 74: Hoare triple {48130#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {48130#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {48130#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {48130#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {48130#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 79: Hoare triple {48130#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 80: Hoare triple {48130#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 81: Hoare triple {48130#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {48130#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 83: Hoare triple {48130#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 84: Hoare triple {48130#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,349 INFO L290 TraceCheckUtils]: 85: Hoare triple {48130#false} assume 8656 == #t~mem72;havoc #t~mem72; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 86: Hoare triple {48130#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 87: Hoare triple {48130#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 88: Hoare triple {48130#false} assume !(2 == ~blastFlag~0); {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 89: Hoare triple {48130#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 90: Hoare triple {48130#false} assume !(0 == ~tmp___10~0); {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 91: Hoare triple {48130#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 92: Hoare triple {48130#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 93: Hoare triple {48130#false} ~skip~0 := 0; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 94: Hoare triple {48130#false} assume !false; {48130#false} is VALID [2022-04-28 15:17:49,350 INFO L290 TraceCheckUtils]: 95: Hoare triple {48130#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 96: Hoare triple {48130#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 97: Hoare triple {48130#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 98: Hoare triple {48130#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 99: Hoare triple {48130#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 100: Hoare triple {48130#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 101: Hoare triple {48130#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 102: Hoare triple {48130#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 103: Hoare triple {48130#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 104: Hoare triple {48130#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,351 INFO L290 TraceCheckUtils]: 105: Hoare triple {48130#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 106: Hoare triple {48130#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 107: Hoare triple {48130#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 108: Hoare triple {48130#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 109: Hoare triple {48130#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 110: Hoare triple {48130#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 111: Hoare triple {48130#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 112: Hoare triple {48130#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 113: Hoare triple {48130#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 114: Hoare triple {48130#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,352 INFO L290 TraceCheckUtils]: 115: Hoare triple {48130#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 116: Hoare triple {48130#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 117: Hoare triple {48130#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 118: Hoare triple {48130#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 119: Hoare triple {48130#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 120: Hoare triple {48130#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 121: Hoare triple {48130#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 122: Hoare triple {48130#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 123: Hoare triple {48130#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 124: Hoare triple {48130#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 125: Hoare triple {48130#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,353 INFO L290 TraceCheckUtils]: 126: Hoare triple {48130#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,354 INFO L290 TraceCheckUtils]: 127: Hoare triple {48130#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-28 15:17:49,354 INFO L290 TraceCheckUtils]: 128: Hoare triple {48130#false} assume 8672 == #t~mem74;havoc #t~mem74; {48130#false} is VALID [2022-04-28 15:17:49,354 INFO L290 TraceCheckUtils]: 129: Hoare triple {48130#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {48130#false} is VALID [2022-04-28 15:17:49,354 INFO L290 TraceCheckUtils]: 130: Hoare triple {48130#false} assume 4 == ~blastFlag~0; {48130#false} is VALID [2022-04-28 15:17:49,354 INFO L290 TraceCheckUtils]: 131: Hoare triple {48130#false} assume !false; {48130#false} is VALID [2022-04-28 15:17:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 15:17:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:49,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140470790] [2022-04-28 15:17:49,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140470790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:49,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:49,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:49,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:49,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980665954] [2022-04-28 15:17:49,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980665954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:49,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:49,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713418372] [2022-04-28 15:17:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:49,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 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 132 [2022-04-28 15:17:49,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:49,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call 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:49,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:49,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:17:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:17:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:17:49,436 INFO L87 Difference]: Start difference. First operand 841 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call 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:51,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:52,418 INFO L93 Difference]: Finished difference Result 1683 states and 2601 transitions. [2022-04-28 15:17:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:17:52,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 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 132 [2022-04-28 15:17:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call 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:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-28 15:17:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call 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:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-28 15:17:52,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-04-28 15:17:52,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:52,773 INFO L225 Difference]: With dead ends: 1683 [2022-04-28 15:17:52,773 INFO L226 Difference]: Without dead ends: 868 [2022-04-28 15:17:52,774 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:17:52,775 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:52,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:17:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-28 15:17:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2022-04-28 15:17:52,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:52,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call 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:52,941 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call 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:52,942 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call 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:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:52,971 INFO L93 Difference]: Finished difference Result 868 states and 1332 transitions. [2022-04-28 15:17:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1332 transitions. [2022-04-28 15:17:52,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:52,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:52,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 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 868 states. [2022-04-28 15:17:52,974 INFO L87 Difference]: Start difference. First operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 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 868 states. [2022-04-28 15:17:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:53,007 INFO L93 Difference]: Finished difference Result 868 states and 1332 transitions. [2022-04-28 15:17:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1332 transitions. [2022-04-28 15:17:53,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:53,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:53,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:53,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call 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:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1332 transitions. [2022-04-28 15:17:53,043 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1332 transitions. Word has length 132 [2022-04-28 15:17:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:53,043 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1332 transitions. [2022-04-28 15:17:53,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call 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:53,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 868 states and 1332 transitions. [2022-04-28 15:17:54,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1332 edges. 1332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1332 transitions. [2022-04-28 15:17:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:17:54,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:54,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:54,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:17:54,070 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 436819035, now seen corresponding path program 1 times [2022-04-28 15:17:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:54,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308322785] [2022-04-28 15:17:54,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:54,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash 436819035, now seen corresponding path program 2 times [2022-04-28 15:17:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:54,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260101710] [2022-04-28 15:17:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:54,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {54982#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54976#true} is VALID [2022-04-28 15:17:54,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {54976#true} assume true; {54976#true} is VALID [2022-04-28 15:17:54,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54976#true} {54976#true} #664#return; {54976#true} is VALID [2022-04-28 15:17:54,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {54976#true} call ULTIMATE.init(); {54982#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:54,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {54976#true} assume true; {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54976#true} {54976#true} #664#return; {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {54976#true} call #t~ret162 := main(); {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {54976#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {54976#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L272 TraceCheckUtils]: 7: Hoare triple {54976#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54976#true} is VALID [2022-04-28 15:17:54,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {54976#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !false; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem50;havoc #t~mem50; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {54977#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {54977#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {54977#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {54977#false} ~skip~0 := 0; {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {54977#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {54977#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {54977#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {54977#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {54977#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {54977#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {54977#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {54977#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {54977#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {54977#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {54977#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {54977#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {54977#false} assume 8496 == #t~mem53;havoc #t~mem53; {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {54977#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {54977#false} assume !(1 == ~blastFlag~0); {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {54977#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {54977#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {54977#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {54977#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {54977#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {54977#false} ~skip~0 := 0; {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-28 15:17:54,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {54977#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {54977#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {54977#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {54977#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {54977#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {54977#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {54977#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {54977#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {54977#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {54977#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {54977#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {54977#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {54977#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {54977#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {54977#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 69: Hoare triple {54977#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 70: Hoare triple {54977#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 71: Hoare triple {54977#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {54977#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {54977#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {54977#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {54977#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {54977#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {54977#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {54977#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {54977#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 80: Hoare triple {54977#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {54977#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 82: Hoare triple {54977#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 83: Hoare triple {54977#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 84: Hoare triple {54977#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,284 INFO L290 TraceCheckUtils]: 85: Hoare triple {54977#false} assume 8656 == #t~mem72;havoc #t~mem72; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {54977#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {54977#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {54977#false} assume !(2 == ~blastFlag~0); {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 89: Hoare triple {54977#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 90: Hoare triple {54977#false} assume !(0 == ~tmp___10~0); {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 91: Hoare triple {54977#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 92: Hoare triple {54977#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {54977#false} ~skip~0 := 0; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 94: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-28 15:17:54,285 INFO L290 TraceCheckUtils]: 95: Hoare triple {54977#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 96: Hoare triple {54977#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {54977#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {54977#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 99: Hoare triple {54977#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 100: Hoare triple {54977#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 101: Hoare triple {54977#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 102: Hoare triple {54977#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 103: Hoare triple {54977#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 104: Hoare triple {54977#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 105: Hoare triple {54977#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,286 INFO L290 TraceCheckUtils]: 106: Hoare triple {54977#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 107: Hoare triple {54977#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 108: Hoare triple {54977#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 109: Hoare triple {54977#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 110: Hoare triple {54977#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 111: Hoare triple {54977#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 112: Hoare triple {54977#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 113: Hoare triple {54977#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 114: Hoare triple {54977#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 115: Hoare triple {54977#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,287 INFO L290 TraceCheckUtils]: 116: Hoare triple {54977#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 117: Hoare triple {54977#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 118: Hoare triple {54977#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 119: Hoare triple {54977#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 120: Hoare triple {54977#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 121: Hoare triple {54977#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 122: Hoare triple {54977#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 123: Hoare triple {54977#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 124: Hoare triple {54977#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 125: Hoare triple {54977#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,288 INFO L290 TraceCheckUtils]: 126: Hoare triple {54977#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,289 INFO L290 TraceCheckUtils]: 127: Hoare triple {54977#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-28 15:17:54,289 INFO L290 TraceCheckUtils]: 128: Hoare triple {54977#false} assume 8672 == #t~mem74;havoc #t~mem74; {54977#false} is VALID [2022-04-28 15:17:54,289 INFO L290 TraceCheckUtils]: 129: Hoare triple {54977#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {54977#false} is VALID [2022-04-28 15:17:54,289 INFO L290 TraceCheckUtils]: 130: Hoare triple {54977#false} assume 4 == ~blastFlag~0; {54977#false} is VALID [2022-04-28 15:17:54,289 INFO L290 TraceCheckUtils]: 131: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-28 15:17:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 15:17:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260101710] [2022-04-28 15:17:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260101710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:54,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:54,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:54,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308322785] [2022-04-28 15:17:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308322785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:54,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:54,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:17:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049879234] [2022-04-28 15:17:54,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 15:17:54,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:54,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:54,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:54,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:17:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:54,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:17:54,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:17:54,356 INFO L87 Difference]: Start difference. First operand 868 states and 1332 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:56,376 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:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:57,246 INFO L93 Difference]: Finished difference Result 1426 states and 2186 transitions. [2022-04-28 15:17:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:17:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 15:17:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-28 15:17:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-28 15:17:57,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 408 transitions. [2022-04-28 15:17:57,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:57,523 INFO L225 Difference]: With dead ends: 1426 [2022-04-28 15:17:57,523 INFO L226 Difference]: Without dead ends: 584 [2022-04-28 15:17:57,525 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:17:57,526 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:57,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 388 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:17:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-28 15:17:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-28 15:17:57,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:57,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call 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:57,687 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call 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:57,688 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call 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:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:57,698 INFO L93 Difference]: Finished difference Result 584 states and 883 transitions. [2022-04-28 15:17:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2022-04-28 15:17:57,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:57,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:57,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 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 584 states. [2022-04-28 15:17:57,700 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 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 584 states. [2022-04-28 15:17:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:57,711 INFO L93 Difference]: Finished difference Result 584 states and 883 transitions. [2022-04-28 15:17:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2022-04-28 15:17:57,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:57,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:57,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:57,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call 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:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 883 transitions. [2022-04-28 15:17:57,729 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 883 transitions. Word has length 132 [2022-04-28 15:17:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:57,730 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 883 transitions. [2022-04-28 15:17:57,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:57,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 883 transitions. [2022-04-28 15:17:58,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 883 edges. 883 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2022-04-28 15:17:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:17:58,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:58,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:58,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:17:58,447 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1803828749, now seen corresponding path program 1 times [2022-04-28 15:17:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:58,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [796758871] [2022-04-28 15:17:58,548 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:58,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1803828749, now seen corresponding path program 2 times [2022-04-28 15:17:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:58,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801683322] [2022-04-28 15:17:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:58,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {60182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {60173#true} is VALID [2022-04-28 15:17:58,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {60173#true} assume true; {60173#true} is VALID [2022-04-28 15:17:58,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60173#true} {60173#true} #664#return; {60173#true} is VALID [2022-04-28 15:17:58,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {60173#true} call ULTIMATE.init(); {60182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:17:58,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {60182#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {60173#true} is VALID [2022-04-28 15:17:58,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {60173#true} assume true; {60173#true} is VALID [2022-04-28 15:17:58,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60173#true} {60173#true} #664#return; {60173#true} is VALID [2022-04-28 15:17:58,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {60173#true} call #t~ret162 := main(); {60173#true} is VALID [2022-04-28 15:17:58,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {60173#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {60173#true} is VALID [2022-04-28 15:17:58,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {60173#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {60178#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:17:58,957 INFO L272 TraceCheckUtils]: 7: Hoare triple {60178#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60179#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:17:58,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {60179#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:17:58,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:17:58,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:17:58,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {60181#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {60181#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {60174#false} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {60174#false} assume 8464 == #t~mem50;havoc #t~mem50; {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {60174#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; {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {60174#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {60174#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {60174#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {60174#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {60174#false} ~skip~0 := 0; {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {60174#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {60174#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {60174#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {60174#false} assume 8496 == #t~mem53;havoc #t~mem53; {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {60174#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {60174#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {60174#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {60174#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {60174#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {60174#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {60174#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {60174#false} ~skip~0 := 0; {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 60: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 62: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {60174#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {60174#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {60174#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {60174#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {60174#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {60174#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {60174#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {60174#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {60174#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {60174#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {60174#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {60174#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {60174#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {60174#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {60174#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {60174#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {60174#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {60174#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {60174#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {60174#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 83: Hoare triple {60174#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {60174#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {60174#false} assume 8656 == #t~mem72;havoc #t~mem72; {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {60174#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {60174#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 88: Hoare triple {60174#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 89: Hoare triple {60174#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {60174#false} is VALID [2022-04-28 15:17:58,970 INFO L290 TraceCheckUtils]: 90: Hoare triple {60174#false} assume !(0 == ~tmp___10~0); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {60174#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 92: Hoare triple {60174#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 93: Hoare triple {60174#false} ~skip~0 := 0; {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 94: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 95: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 96: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 97: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 98: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 99: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 100: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,971 INFO L290 TraceCheckUtils]: 101: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 102: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 103: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 104: Hoare triple {60174#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 105: Hoare triple {60174#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 106: Hoare triple {60174#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 107: Hoare triple {60174#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 108: Hoare triple {60174#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 109: Hoare triple {60174#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 110: Hoare triple {60174#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,972 INFO L290 TraceCheckUtils]: 111: Hoare triple {60174#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 112: Hoare triple {60174#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 113: Hoare triple {60174#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 114: Hoare triple {60174#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 115: Hoare triple {60174#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 116: Hoare triple {60174#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 117: Hoare triple {60174#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 118: Hoare triple {60174#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 119: Hoare triple {60174#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 120: Hoare triple {60174#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 121: Hoare triple {60174#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,973 INFO L290 TraceCheckUtils]: 122: Hoare triple {60174#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 123: Hoare triple {60174#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 124: Hoare triple {60174#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 125: Hoare triple {60174#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 126: Hoare triple {60174#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 127: Hoare triple {60174#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 128: Hoare triple {60174#false} assume 8672 == #t~mem74;havoc #t~mem74; {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 129: Hoare triple {60174#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 130: Hoare triple {60174#false} assume !(4 == ~blastFlag~0); {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 131: Hoare triple {60174#false} assume 5 == ~blastFlag~0; {60174#false} is VALID [2022-04-28 15:17:58,974 INFO L290 TraceCheckUtils]: 132: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-28 15:17:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 15:17:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:58,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801683322] [2022-04-28 15:17:58,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801683322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:58,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:58,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:17:58,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [796758871] [2022-04-28 15:17:58,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [796758871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:58,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:58,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:17:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877431661] [2022-04-28 15:17:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:58,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 15:17:58,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:58,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:59,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:59,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:17:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:17:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:17:59,043 INFO L87 Difference]: Start difference. First operand 584 states and 883 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:01,087 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:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:02,712 INFO L93 Difference]: Finished difference Result 1161 states and 1758 transitions. [2022-04-28 15:18:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:18:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 15:18:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-28 15:18:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-28 15:18:02,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 404 transitions. [2022-04-28 15:18:02,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:02,990 INFO L225 Difference]: With dead ends: 1161 [2022-04-28 15:18:02,990 INFO L226 Difference]: Without dead ends: 584 [2022-04-28 15:18:02,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:18:02,991 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:02,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 796 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-28 15:18:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-28 15:18:03,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:03,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call 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:03,154 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call 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:03,154 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call 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:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:03,166 INFO L93 Difference]: Finished difference Result 584 states and 882 transitions. [2022-04-28 15:18:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 882 transitions. [2022-04-28 15:18:03,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:03,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:03,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 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 584 states. [2022-04-28 15:18:03,168 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 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 584 states. [2022-04-28 15:18:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:03,184 INFO L93 Difference]: Finished difference Result 584 states and 882 transitions. [2022-04-28 15:18:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 882 transitions. [2022-04-28 15:18:03,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:03,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:03,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:03,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call 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:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 882 transitions. [2022-04-28 15:18:03,207 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 882 transitions. Word has length 133 [2022-04-28 15:18:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:03,207 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 882 transitions. [2022-04-28 15:18:03,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:03,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 882 transitions. [2022-04-28 15:18:03,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 882 transitions. [2022-04-28 15:18:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:18:03,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:03,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:03,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:18:03,917 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2056632949, now seen corresponding path program 1 times [2022-04-28 15:18:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:03,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263689469] [2022-04-28 15:18:04,011 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:04,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2056632949, now seen corresponding path program 2 times [2022-04-28 15:18:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434465543] [2022-04-28 15:18:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:18:04,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 15:18:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:18:04,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 15:18:04,684 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 15:18:04,684 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 15:18:04,693 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:18:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:18:04,697 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:18:04,700 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:18:04,747 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:18:04,747 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-28 15:18:04,747 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 15:18:04,747 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:18:04,747 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-28 15:18:04,748 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1747-1 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1145-2 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-28 15:18:04,749 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1151-1 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-28 15:18:04,750 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1731-2 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-28 15:18:04,751 WARN L170 areAnnotationChecker]: L1284-2 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1295-2 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-28 15:18:04,752 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1696-1 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-28 15:18:04,753 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-28 15:18:04,754 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1378-2 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-28 15:18:04,755 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1403-2 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1426 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-28 15:18:04,756 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1414-1 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-28 15:18:04,757 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-28 15:18:04,758 WARN L170 areAnnotationChecker]: L1503-2 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:18:04,759 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-28 15:18:04,760 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-28 15:18:04,761 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-28 15:18:04,761 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-28 15:18:04,761 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-28 15:18:04,761 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1574-2 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-28 15:18:04,762 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1275 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-28 15:18:04,763 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-28 15:18:04,764 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-28 15:18:04,764 WARN L170 areAnnotationChecker]: L1640-1 has no Hoare annotation [2022-04-28 15:18:04,764 WARN L170 areAnnotationChecker]: L1630-2 has no Hoare annotation [2022-04-28 15:18:04,764 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:18:04,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:18:04 BoogieIcfgContainer [2022-04-28 15:18:04,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:18:04,768 INFO L158 Benchmark]: Toolchain (without parser) took 133093.07ms. Allocated memory was 175.1MB in the beginning and 227.5MB in the end (delta: 52.4MB). Free memory was 126.4MB in the beginning and 140.9MB in the end (delta: -14.6MB). Peak memory consumption was 128.3MB. Max. memory is 8.0GB. [2022-04-28 15:18:04,768 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 175.1MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:18:04,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.63ms. Allocated memory is still 175.1MB. Free memory was 126.2MB in the beginning and 130.7MB in the end (delta: -4.5MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-04-28 15:18:04,770 INFO L158 Benchmark]: Boogie Preprocessor took 118.00ms. Allocated memory is still 175.1MB. Free memory was 130.7MB in the beginning and 120.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:18:04,770 INFO L158 Benchmark]: RCFGBuilder took 2557.97ms. Allocated memory was 175.1MB in the beginning and 227.5MB in the end (delta: 52.4MB). Free memory was 120.8MB in the beginning and 150.2MB in the end (delta: -29.4MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2022-04-28 15:18:04,774 INFO L158 Benchmark]: TraceAbstraction took 129536.15ms. Allocated memory is still 227.5MB. Free memory was 149.7MB in the beginning and 140.9MB in the end (delta: 8.8MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. [2022-04-28 15:18:04,777 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 175.1MB. Free memory was 145.2MB in the beginning and 145.1MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 873.63ms. Allocated memory is still 175.1MB. Free memory was 126.2MB in the beginning and 130.7MB in the end (delta: -4.5MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 118.00ms. Allocated memory is still 175.1MB. Free memory was 130.7MB in the beginning and 120.8MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2557.97ms. Allocated memory was 175.1MB in the beginning and 227.5MB in the end (delta: 52.4MB). Free memory was 120.8MB in the beginning and 150.2MB in the end (delta: -29.4MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. * TraceAbstraction took 129536.15ms. Allocated memory is still 227.5MB. Free memory was 149.7MB in the beginning and 140.9MB in the end (delta: 8.8MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) [L1160] EXPR s->cert [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 [L1373] COND FALSE !(ret <= 0) [L1378] s->hit [L1378] COND TRUE s->hit [L1379] s->state = 8656 [L1383] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) [L1618] COND TRUE blastFlag == 5 [L1737] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 129.4s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 108.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 1679 SdHoareTripleChecker+Valid, 75.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1679 mSDsluCounter, 12236 SdHoareTripleChecker+Invalid, 74.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7391 mSDsCounter, 630 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10434 IncrementalHoareTripleChecker+Invalid, 11095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 630 mSolverCounterUnsat, 4845 mSDtfsCounter, 10434 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=25, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 922 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 15:18:04,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...